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.11.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:35:50,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:35:50,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:35:50,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:35:50,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:35:50,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:35:50,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:35:50,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:35:50,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:35:50,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:35:50,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:35:50,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:35:50,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:35:50,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:35:50,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:35:50,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:35:50,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:35:50,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:35:50,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:35:50,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:35:50,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:35:50,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:35:50,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:35:50,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:35:50,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:35:50,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:35:50,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:35:50,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:35:50,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:35:50,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:35:50,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:35:50,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:35:50,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:35:50,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:35:50,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:35:50,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:35:50,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:35:50,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:35:50,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:35:50,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:35:50,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:35:50,154 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:35:50,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:35:50,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:35:50,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:35:50,179 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:35:50,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:35:50,180 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:35:50,180 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:35:50,180 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:35:50,180 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:35:50,180 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:35:50,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:35:50,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:35:50,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:35:50,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:35:50,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:35:50,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:35:50,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:35:50,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:35:50,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:35:50,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:35:50,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:35:50,185 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:35:50,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:35:50,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:35:50,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:35:50,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:35:50,186 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:35:50,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:35:50,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:35:50,187 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:35:50,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:35:50,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:35:50,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:35:50,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:35:50,252 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:35:50,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.11.cil-1.c [2019-09-10 03:35:50,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11377ee9d/ef35153f3ac74bd190cb7611227a6d1c/FLAGf3faca957 [2019-09-10 03:35:50,824 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:35:50,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.11.cil-1.c [2019-09-10 03:35:50,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11377ee9d/ef35153f3ac74bd190cb7611227a6d1c/FLAGf3faca957 [2019-09-10 03:35:51,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11377ee9d/ef35153f3ac74bd190cb7611227a6d1c [2019-09-10 03:35:51,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:35:51,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:35:51,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:35:51,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:35:51,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:35:51,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:51,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3d8e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51, skipping insertion in model container [2019-09-10 03:35:51,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:51,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:35:51,225 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:35:51,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:35:51,702 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:35:51,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:35:51,898 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:35:51,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51 WrapperNode [2019-09-10 03:35:51,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:35:51,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:35:51,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:35:51,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:35:51,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:51,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:51,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:51,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:51,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:52,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:52,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... [2019-09-10 03:35:52,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:35:52,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:35:52,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:35:52,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:35:52,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:35:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:35:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:35:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:35:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:35:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:35:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:35:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:35:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:35:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:35:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:35:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:35:52,110 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:35:52,110 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:35:52,111 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:35:52,111 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:35:52,112 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:35:52,112 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:35:52,112 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:35:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:35:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:35:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:35:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:35:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:35:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:35:52,114 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:35:52,115 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:35:52,115 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:35:52,115 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:35:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:35:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:35:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:35:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:35:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:35:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:35:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:35:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:35:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:35:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:35:52,118 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:35:52,118 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:35:52,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:35:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:35:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:35:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:35:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:35:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:35:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:35:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:35:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:35:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:35:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:35:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:35:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:35:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:35:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:35:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:35:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:35:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:35:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:35:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:35:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:35:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:35:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:35:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:35:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:35:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:35:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:35:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:35:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:35:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:35:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:35:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:35:53,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:35:53,383 INFO L283 CfgBuilder]: Removed 14 assume(true) statements. [2019-09-10 03:35:53,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:35:53 BoogieIcfgContainer [2019-09-10 03:35:53,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:35:53,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:35:53,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:35:53,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:35:53,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:35:51" (1/3) ... [2019-09-10 03:35:53,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c4ee6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:35:53, skipping insertion in model container [2019-09-10 03:35:53,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:51" (2/3) ... [2019-09-10 03:35:53,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c4ee6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:35:53, skipping insertion in model container [2019-09-10 03:35:53,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:35:53" (3/3) ... [2019-09-10 03:35:53,394 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.11.cil-1.c [2019-09-10 03:35:53,403 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:35:53,424 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:35:53,442 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:35:53,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:35:53,478 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:35:53,478 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:35:53,478 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:35:53,478 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:35:53,479 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:35:53,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:35:53,479 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:35:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states. [2019-09-10 03:35:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:35:53,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:53,559 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] [2019-09-10 03:35:53,561 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1039825575, now seen corresponding path program 1 times [2019-09-10 03:35:53,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:53,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:53,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:54,190 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:35:54,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:54,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:35:54,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:54,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:35:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:35:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:35:54,223 INFO L87 Difference]: Start difference. First operand 451 states. Second operand 4 states. [2019-09-10 03:35:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:54,713 INFO L93 Difference]: Finished difference Result 449 states and 655 transitions. [2019-09-10 03:35:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:35:54,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:35:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:54,745 INFO L225 Difference]: With dead ends: 449 [2019-09-10 03:35:54,745 INFO L226 Difference]: Without dead ends: 442 [2019-09-10 03:35:54,747 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:35:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-10 03:35:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-09-10 03:35:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:35:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 648 transitions. [2019-09-10 03:35:54,827 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 648 transitions. Word has length 218 [2019-09-10 03:35:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:54,829 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 648 transitions. [2019-09-10 03:35:54,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:35:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 648 transitions. [2019-09-10 03:35:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:35:54,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:54,841 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] [2019-09-10 03:35:54,841 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:54,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1912236137, now seen corresponding path program 1 times [2019-09-10 03:35:54,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:54,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:54,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:54,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:55,110 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:35:55,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:55,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:35:55,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:55,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:35:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:35:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:35:55,119 INFO L87 Difference]: Start difference. First operand 442 states and 648 transitions. Second operand 4 states. [2019-09-10 03:35:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:55,415 INFO L93 Difference]: Finished difference Result 442 states and 647 transitions. [2019-09-10 03:35:55,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:35:55,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:35:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:55,421 INFO L225 Difference]: With dead ends: 442 [2019-09-10 03:35:55,421 INFO L226 Difference]: Without dead ends: 442 [2019-09-10 03:35:55,422 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:35:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-10 03:35:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-09-10 03:35:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:35:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 647 transitions. [2019-09-10 03:35:55,453 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 647 transitions. Word has length 218 [2019-09-10 03:35:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:55,454 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 647 transitions. [2019-09-10 03:35:55,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:35:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 647 transitions. [2019-09-10 03:35:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:35:55,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:55,458 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] [2019-09-10 03:35:55,458 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1985820715, now seen corresponding path program 1 times [2019-09-10 03:35:55,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:55,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:55,687 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:35:55,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:55,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:55,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:55,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:55,690 INFO L87 Difference]: Start difference. First operand 442 states and 647 transitions. Second operand 5 states. [2019-09-10 03:35:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:56,758 INFO L93 Difference]: Finished difference Result 508 states and 769 transitions. [2019-09-10 03:35:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:35:56,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:35:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:56,763 INFO L225 Difference]: With dead ends: 508 [2019-09-10 03:35:56,764 INFO L226 Difference]: Without dead ends: 508 [2019-09-10 03:35:56,764 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:35:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-10 03:35:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 442. [2019-09-10 03:35:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:35:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 646 transitions. [2019-09-10 03:35:56,810 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 646 transitions. Word has length 218 [2019-09-10 03:35:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:56,810 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 646 transitions. [2019-09-10 03:35:56,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:35:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 646 transitions. [2019-09-10 03:35:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:35:56,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:56,820 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] [2019-09-10 03:35:56,820 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1406226003, now seen corresponding path program 1 times [2019-09-10 03:35:56,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:56,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:56,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:56,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:56,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:57,044 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:35:57,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:57,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:57,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:57,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:57,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:57,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:57,046 INFO L87 Difference]: Start difference. First operand 442 states and 646 transitions. Second operand 5 states. [2019-09-10 03:35:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:57,916 INFO L93 Difference]: Finished difference Result 508 states and 769 transitions. [2019-09-10 03:35:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:35:57,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:35:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:57,920 INFO L225 Difference]: With dead ends: 508 [2019-09-10 03:35:57,920 INFO L226 Difference]: Without dead ends: 508 [2019-09-10 03:35:57,921 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:35:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-10 03:35:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 442. [2019-09-10 03:35:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:35:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 645 transitions. [2019-09-10 03:35:57,938 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 645 transitions. Word has length 218 [2019-09-10 03:35:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:57,938 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 645 transitions. [2019-09-10 03:35:57,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:35:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 645 transitions. [2019-09-10 03:35:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:35:57,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:57,969 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] [2019-09-10 03:35:57,970 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1654194197, now seen corresponding path program 1 times [2019-09-10 03:35:57,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:57,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:58,107 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:35:58,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:58,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:58,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:58,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:58,118 INFO L87 Difference]: Start difference. First operand 442 states and 645 transitions. Second operand 5 states. [2019-09-10 03:35:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:58,999 INFO L93 Difference]: Finished difference Result 506 states and 764 transitions. [2019-09-10 03:35:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:35:58,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:35:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:59,004 INFO L225 Difference]: With dead ends: 506 [2019-09-10 03:35:59,004 INFO L226 Difference]: Without dead ends: 506 [2019-09-10 03:35:59,005 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:35:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-10 03:35:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 442. [2019-09-10 03:35:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:35:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 644 transitions. [2019-09-10 03:35:59,045 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 644 transitions. Word has length 218 [2019-09-10 03:35:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:59,046 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 644 transitions. [2019-09-10 03:35:59,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:35:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 644 transitions. [2019-09-10 03:35:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:35:59,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:59,053 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] [2019-09-10 03:35:59,053 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1662193171, now seen corresponding path program 1 times [2019-09-10 03:35:59,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:59,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:59,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:59,161 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:35:59,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:59,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:59,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:59,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:59,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:59,163 INFO L87 Difference]: Start difference. First operand 442 states and 644 transitions. Second operand 5 states. [2019-09-10 03:36:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:00,016 INFO L93 Difference]: Finished difference Result 504 states and 759 transitions. [2019-09-10 03:36:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:00,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:00,024 INFO L225 Difference]: With dead ends: 504 [2019-09-10 03:36:00,024 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 03:36:00,024 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:36:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 03:36:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 442. [2019-09-10 03:36:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 643 transitions. [2019-09-10 03:36:00,066 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 643 transitions. Word has length 218 [2019-09-10 03:36:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:00,067 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 643 transitions. [2019-09-10 03:36:00,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 643 transitions. [2019-09-10 03:36:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:00,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:00,070 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] [2019-09-10 03:36:00,071 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:00,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash -138430549, now seen corresponding path program 1 times [2019-09-10 03:36:00,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:00,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:00,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:00,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:00,170 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:36:00,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:00,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:00,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:00,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:00,172 INFO L87 Difference]: Start difference. First operand 442 states and 643 transitions. Second operand 5 states. [2019-09-10 03:36:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:01,084 INFO L93 Difference]: Finished difference Result 502 states and 754 transitions. [2019-09-10 03:36:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:01,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:01,090 INFO L225 Difference]: With dead ends: 502 [2019-09-10 03:36:01,090 INFO L226 Difference]: Without dead ends: 502 [2019-09-10 03:36:01,090 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:36:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-10 03:36:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 442. [2019-09-10 03:36:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 642 transitions. [2019-09-10 03:36:01,110 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 642 transitions. Word has length 218 [2019-09-10 03:36:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:01,111 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 642 transitions. [2019-09-10 03:36:01,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 642 transitions. [2019-09-10 03:36:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:01,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:01,115 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] [2019-09-10 03:36:01,116 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1019101741, now seen corresponding path program 1 times [2019-09-10 03:36:01,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:01,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:01,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:01,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:01,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:01,271 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:36:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:01,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:01,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:01,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:01,274 INFO L87 Difference]: Start difference. First operand 442 states and 642 transitions. Second operand 5 states. [2019-09-10 03:36:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:02,121 INFO L93 Difference]: Finished difference Result 500 states and 749 transitions. [2019-09-10 03:36:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:02,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:02,127 INFO L225 Difference]: With dead ends: 500 [2019-09-10 03:36:02,127 INFO L226 Difference]: Without dead ends: 500 [2019-09-10 03:36:02,128 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:36:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-10 03:36:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 442. [2019-09-10 03:36:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 641 transitions. [2019-09-10 03:36:02,142 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 641 transitions. Word has length 218 [2019-09-10 03:36:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:02,142 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 641 transitions. [2019-09-10 03:36:02,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 641 transitions. [2019-09-10 03:36:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:02,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:02,144 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] [2019-09-10 03:36:02,145 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -329031829, now seen corresponding path program 1 times [2019-09-10 03:36:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:02,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:02,246 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:36:02,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:02,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:02,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:02,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:02,247 INFO L87 Difference]: Start difference. First operand 442 states and 641 transitions. Second operand 5 states. [2019-09-10 03:36:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:03,164 INFO L93 Difference]: Finished difference Result 496 states and 740 transitions. [2019-09-10 03:36:03,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:03,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:03,168 INFO L225 Difference]: With dead ends: 496 [2019-09-10 03:36:03,168 INFO L226 Difference]: Without dead ends: 496 [2019-09-10 03:36:03,169 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:36:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-10 03:36:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 442. [2019-09-10 03:36:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 640 transitions. [2019-09-10 03:36:03,190 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 640 transitions. Word has length 218 [2019-09-10 03:36:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:03,191 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 640 transitions. [2019-09-10 03:36:03,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 640 transitions. [2019-09-10 03:36:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:03,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:03,193 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] [2019-09-10 03:36:03,193 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash 143307817, now seen corresponding path program 1 times [2019-09-10 03:36:03,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:03,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:03,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:03,314 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:36:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:03,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:03,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:03,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:03,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:03,316 INFO L87 Difference]: Start difference. First operand 442 states and 640 transitions. Second operand 5 states. [2019-09-10 03:36:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:04,365 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2019-09-10 03:36:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:04,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:04,372 INFO L225 Difference]: With dead ends: 494 [2019-09-10 03:36:04,372 INFO L226 Difference]: Without dead ends: 494 [2019-09-10 03:36:04,373 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:36:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-10 03:36:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 442. [2019-09-10 03:36:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 639 transitions. [2019-09-10 03:36:04,389 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 639 transitions. Word has length 218 [2019-09-10 03:36:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:04,390 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 639 transitions. [2019-09-10 03:36:04,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 639 transitions. [2019-09-10 03:36:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:04,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:04,392 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] [2019-09-10 03:36:04,393 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -672739413, now seen corresponding path program 1 times [2019-09-10 03:36:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:04,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:04,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:04,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:04,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:04,499 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:36:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:04,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:04,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:04,501 INFO L87 Difference]: Start difference. First operand 442 states and 639 transitions. Second operand 5 states. [2019-09-10 03:36:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:05,413 INFO L93 Difference]: Finished difference Result 492 states and 730 transitions. [2019-09-10 03:36:05,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:05,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:05,417 INFO L225 Difference]: With dead ends: 492 [2019-09-10 03:36:05,417 INFO L226 Difference]: Without dead ends: 492 [2019-09-10 03:36:05,418 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:36:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-09-10 03:36:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 442. [2019-09-10 03:36:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 638 transitions. [2019-09-10 03:36:05,430 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 638 transitions. Word has length 218 [2019-09-10 03:36:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:05,431 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 638 transitions. [2019-09-10 03:36:05,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 638 transitions. [2019-09-10 03:36:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:05,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:05,433 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] [2019-09-10 03:36:05,433 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1656241129, now seen corresponding path program 1 times [2019-09-10 03:36:05,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:05,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:05,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:05,533 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:36:05,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:05,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:05,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:05,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:05,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:05,535 INFO L87 Difference]: Start difference. First operand 442 states and 638 transitions. Second operand 5 states. [2019-09-10 03:36:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:06,427 INFO L93 Difference]: Finished difference Result 490 states and 725 transitions. [2019-09-10 03:36:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:06,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:06,431 INFO L225 Difference]: With dead ends: 490 [2019-09-10 03:36:06,431 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 03:36:06,432 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:36:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 03:36:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 442. [2019-09-10 03:36:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 637 transitions. [2019-09-10 03:36:06,444 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 637 transitions. Word has length 218 [2019-09-10 03:36:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:06,444 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 637 transitions. [2019-09-10 03:36:06,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 637 transitions. [2019-09-10 03:36:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:06,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:06,446 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] [2019-09-10 03:36:06,447 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1039577109, now seen corresponding path program 1 times [2019-09-10 03:36:06,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:06,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:06,546 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:36:06,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:06,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:06,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:06,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:06,549 INFO L87 Difference]: Start difference. First operand 442 states and 637 transitions. Second operand 5 states. [2019-09-10 03:36:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:07,397 INFO L93 Difference]: Finished difference Result 488 states and 720 transitions. [2019-09-10 03:36:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:07,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:07,402 INFO L225 Difference]: With dead ends: 488 [2019-09-10 03:36:07,402 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 03:36:07,403 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:36:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 03:36:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 442. [2019-09-10 03:36:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-09-10 03:36:07,429 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 218 [2019-09-10 03:36:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:07,429 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-09-10 03:36:07,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-09-10 03:36:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:07,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:07,433 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] [2019-09-10 03:36:07,433 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:07,434 INFO L82 PathProgramCache]: Analyzing trace with hash -433802327, now seen corresponding path program 1 times [2019-09-10 03:36:07,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:07,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:07,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:07,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:07,690 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:36:07,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:07,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:07,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:07,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:07,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:07,692 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 5 states. [2019-09-10 03:36:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:08,582 INFO L93 Difference]: Finished difference Result 532 states and 801 transitions. [2019-09-10 03:36:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:08,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:08,586 INFO L225 Difference]: With dead ends: 532 [2019-09-10 03:36:08,586 INFO L226 Difference]: Without dead ends: 532 [2019-09-10 03:36:08,586 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:36:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-10 03:36:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 442. [2019-09-10 03:36:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 635 transitions. [2019-09-10 03:36:08,598 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 635 transitions. Word has length 218 [2019-09-10 03:36:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:08,599 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 635 transitions. [2019-09-10 03:36:08,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 635 transitions. [2019-09-10 03:36:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:08,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:08,601 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] [2019-09-10 03:36:08,601 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash -414261205, now seen corresponding path program 1 times [2019-09-10 03:36:08,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:08,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:08,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:08,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:08,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:08,695 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:36:08,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:08,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:08,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:08,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:08,697 INFO L87 Difference]: Start difference. First operand 442 states and 635 transitions. Second operand 5 states. [2019-09-10 03:36:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:09,636 INFO L93 Difference]: Finished difference Result 526 states and 791 transitions. [2019-09-10 03:36:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:09,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:09,643 INFO L225 Difference]: With dead ends: 526 [2019-09-10 03:36:09,643 INFO L226 Difference]: Without dead ends: 526 [2019-09-10 03:36:09,647 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:36:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-10 03:36:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 442. [2019-09-10 03:36:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 634 transitions. [2019-09-10 03:36:09,667 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 634 transitions. Word has length 218 [2019-09-10 03:36:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:09,668 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 634 transitions. [2019-09-10 03:36:09,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 634 transitions. [2019-09-10 03:36:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:09,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:09,670 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] [2019-09-10 03:36:09,670 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1244914839, now seen corresponding path program 1 times [2019-09-10 03:36:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:09,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:09,924 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:36:09,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:09,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:09,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:09,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:09,930 INFO L87 Difference]: Start difference. First operand 442 states and 634 transitions. Second operand 5 states. [2019-09-10 03:36:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:11,117 INFO L93 Difference]: Finished difference Result 526 states and 787 transitions. [2019-09-10 03:36:11,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:11,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:11,122 INFO L225 Difference]: With dead ends: 526 [2019-09-10 03:36:11,122 INFO L226 Difference]: Without dead ends: 526 [2019-09-10 03:36:11,123 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:36:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-10 03:36:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 442. [2019-09-10 03:36:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 633 transitions. [2019-09-10 03:36:11,140 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 633 transitions. Word has length 218 [2019-09-10 03:36:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:11,142 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 633 transitions. [2019-09-10 03:36:11,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 633 transitions. [2019-09-10 03:36:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:11,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:11,145 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] [2019-09-10 03:36:11,146 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1681591847, now seen corresponding path program 1 times [2019-09-10 03:36:11,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:11,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:11,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:11,308 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:36:11,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:11,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:11,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:11,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:11,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:11,314 INFO L87 Difference]: Start difference. First operand 442 states and 633 transitions. Second operand 5 states. [2019-09-10 03:36:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:12,470 INFO L93 Difference]: Finished difference Result 524 states and 782 transitions. [2019-09-10 03:36:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:12,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:12,474 INFO L225 Difference]: With dead ends: 524 [2019-09-10 03:36:12,474 INFO L226 Difference]: Without dead ends: 524 [2019-09-10 03:36:12,475 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:36:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-10 03:36:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 442. [2019-09-10 03:36:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 632 transitions. [2019-09-10 03:36:12,490 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 632 transitions. Word has length 218 [2019-09-10 03:36:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:12,490 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 632 transitions. [2019-09-10 03:36:12,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 632 transitions. [2019-09-10 03:36:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:12,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:12,493 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] [2019-09-10 03:36:12,494 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1964782679, now seen corresponding path program 1 times [2019-09-10 03:36:12,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:12,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:12,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:12,640 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:36:12,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:12,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:12,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:12,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:12,642 INFO L87 Difference]: Start difference. First operand 442 states and 632 transitions. Second operand 5 states. [2019-09-10 03:36:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:13,568 INFO L93 Difference]: Finished difference Result 522 states and 777 transitions. [2019-09-10 03:36:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:13,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:13,572 INFO L225 Difference]: With dead ends: 522 [2019-09-10 03:36:13,572 INFO L226 Difference]: Without dead ends: 522 [2019-09-10 03:36:13,573 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:36:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-10 03:36:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 442. [2019-09-10 03:36:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 631 transitions. [2019-09-10 03:36:13,585 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 631 transitions. Word has length 218 [2019-09-10 03:36:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:13,585 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 631 transitions. [2019-09-10 03:36:13,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 631 transitions. [2019-09-10 03:36:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:13,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:13,589 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] [2019-09-10 03:36:13,590 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 827086311, now seen corresponding path program 1 times [2019-09-10 03:36:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:13,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:13,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:13,703 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:36:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:13,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:13,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:13,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:13,706 INFO L87 Difference]: Start difference. First operand 442 states and 631 transitions. Second operand 5 states. [2019-09-10 03:36:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:14,556 INFO L93 Difference]: Finished difference Result 520 states and 772 transitions. [2019-09-10 03:36:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:14,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:14,561 INFO L225 Difference]: With dead ends: 520 [2019-09-10 03:36:14,561 INFO L226 Difference]: Without dead ends: 520 [2019-09-10 03:36:14,563 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:36:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-10 03:36:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 442. [2019-09-10 03:36:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 630 transitions. [2019-09-10 03:36:14,578 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 630 transitions. Word has length 218 [2019-09-10 03:36:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:14,578 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 630 transitions. [2019-09-10 03:36:14,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 630 transitions. [2019-09-10 03:36:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:14,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:14,580 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] [2019-09-10 03:36:14,581 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash 917146601, now seen corresponding path program 1 times [2019-09-10 03:36:14,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:14,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:14,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:14,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:14,743 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:36:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:14,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:14,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:14,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:14,745 INFO L87 Difference]: Start difference. First operand 442 states and 630 transitions. Second operand 5 states. [2019-09-10 03:36:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:15,600 INFO L93 Difference]: Finished difference Result 518 states and 767 transitions. [2019-09-10 03:36:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:15,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:15,603 INFO L225 Difference]: With dead ends: 518 [2019-09-10 03:36:15,603 INFO L226 Difference]: Without dead ends: 518 [2019-09-10 03:36:15,604 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:36:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-10 03:36:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 442. [2019-09-10 03:36:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 629 transitions. [2019-09-10 03:36:15,615 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 629 transitions. Word has length 218 [2019-09-10 03:36:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:15,615 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 629 transitions. [2019-09-10 03:36:15,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 629 transitions. [2019-09-10 03:36:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:15,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:15,618 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] [2019-09-10 03:36:15,618 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash 227315111, now seen corresponding path program 1 times [2019-09-10 03:36:15,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:15,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:15,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:15,714 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:36:15,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:15,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:15,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:15,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:15,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:15,716 INFO L87 Difference]: Start difference. First operand 442 states and 629 transitions. Second operand 5 states. [2019-09-10 03:36:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:16,574 INFO L93 Difference]: Finished difference Result 516 states and 762 transitions. [2019-09-10 03:36:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:16,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:16,578 INFO L225 Difference]: With dead ends: 516 [2019-09-10 03:36:16,578 INFO L226 Difference]: Without dead ends: 516 [2019-09-10 03:36:16,579 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:36:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-10 03:36:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 442. [2019-09-10 03:36:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 628 transitions. [2019-09-10 03:36:16,591 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 628 transitions. Word has length 218 [2019-09-10 03:36:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:16,591 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 628 transitions. [2019-09-10 03:36:16,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 628 transitions. [2019-09-10 03:36:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:16,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:16,593 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] [2019-09-10 03:36:16,593 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:16,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1180410839, now seen corresponding path program 1 times [2019-09-10 03:36:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:16,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:16,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:16,814 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:36:16,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:16,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:16,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:16,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:16,817 INFO L87 Difference]: Start difference. First operand 442 states and 628 transitions. Second operand 5 states. [2019-09-10 03:36:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:17,686 INFO L93 Difference]: Finished difference Result 514 states and 757 transitions. [2019-09-10 03:36:17,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:17,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:17,691 INFO L225 Difference]: With dead ends: 514 [2019-09-10 03:36:17,692 INFO L226 Difference]: Without dead ends: 514 [2019-09-10 03:36:17,692 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:36:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-10 03:36:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 442. [2019-09-10 03:36:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 627 transitions. [2019-09-10 03:36:17,704 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 627 transitions. Word has length 218 [2019-09-10 03:36:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:17,704 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 627 transitions. [2019-09-10 03:36:17,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 627 transitions. [2019-09-10 03:36:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:17,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:17,706 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] [2019-09-10 03:36:17,706 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:17,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash -671632025, now seen corresponding path program 1 times [2019-09-10 03:36:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:17,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:17,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:17,815 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:36:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:17,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:17,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:17,816 INFO L87 Difference]: Start difference. First operand 442 states and 627 transitions. Second operand 5 states. [2019-09-10 03:36:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:18,648 INFO L93 Difference]: Finished difference Result 510 states and 748 transitions. [2019-09-10 03:36:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:18,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:18,652 INFO L225 Difference]: With dead ends: 510 [2019-09-10 03:36:18,652 INFO L226 Difference]: Without dead ends: 510 [2019-09-10 03:36:18,653 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:36:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-10 03:36:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 442. [2019-09-10 03:36:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 03:36:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2019-09-10 03:36:18,664 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 218 [2019-09-10 03:36:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:18,664 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2019-09-10 03:36:18,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2019-09-10 03:36:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:18,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:18,666 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] [2019-09-10 03:36:18,666 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1898726949, now seen corresponding path program 1 times [2019-09-10 03:36:18,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:18,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:18,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:18,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:18,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:18,749 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:36:18,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:18,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:18,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:18,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:18,754 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 6 states. [2019-09-10 03:36:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:18,794 INFO L93 Difference]: Finished difference Result 482 states and 691 transitions. [2019-09-10 03:36:18,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:18,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:18,798 INFO L225 Difference]: With dead ends: 482 [2019-09-10 03:36:18,798 INFO L226 Difference]: Without dead ends: 482 [2019-09-10 03:36:18,803 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:36:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-10 03:36:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 447. [2019-09-10 03:36:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 03:36:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 631 transitions. [2019-09-10 03:36:18,823 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 631 transitions. Word has length 218 [2019-09-10 03:36:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:18,823 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 631 transitions. [2019-09-10 03:36:18,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 631 transitions. [2019-09-10 03:36:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:18,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:18,825 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] [2019-09-10 03:36:18,825 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash -949659481, now seen corresponding path program 1 times [2019-09-10 03:36:18,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:18,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:18,950 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:36:18,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:18,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:18,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:18,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:18,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:18,952 INFO L87 Difference]: Start difference. First operand 447 states and 631 transitions. Second operand 6 states. [2019-09-10 03:36:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:18,984 INFO L93 Difference]: Finished difference Result 484 states and 691 transitions. [2019-09-10 03:36:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:18,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:18,987 INFO L225 Difference]: With dead ends: 484 [2019-09-10 03:36:18,988 INFO L226 Difference]: Without dead ends: 484 [2019-09-10 03:36:18,988 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:36:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-10 03:36:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 452. [2019-09-10 03:36:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-10 03:36:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 636 transitions. [2019-09-10 03:36:18,998 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 636 transitions. Word has length 218 [2019-09-10 03:36:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:18,998 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 636 transitions. [2019-09-10 03:36:18,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 636 transitions. [2019-09-10 03:36:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:19,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:19,000 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] [2019-09-10 03:36:19,000 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1490088987, now seen corresponding path program 1 times [2019-09-10 03:36:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:19,080 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:36:19,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:19,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:19,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:19,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:19,081 INFO L87 Difference]: Start difference. First operand 452 states and 636 transitions. Second operand 6 states. [2019-09-10 03:36:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:19,110 INFO L93 Difference]: Finished difference Result 486 states and 691 transitions. [2019-09-10 03:36:19,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:19,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:19,113 INFO L225 Difference]: With dead ends: 486 [2019-09-10 03:36:19,113 INFO L226 Difference]: Without dead ends: 486 [2019-09-10 03:36:19,113 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:36:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-10 03:36:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 457. [2019-09-10 03:36:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-09-10 03:36:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 641 transitions. [2019-09-10 03:36:19,123 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 641 transitions. Word has length 218 [2019-09-10 03:36:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:19,123 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 641 transitions. [2019-09-10 03:36:19,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 641 transitions. [2019-09-10 03:36:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:19,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:19,125 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] [2019-09-10 03:36:19,125 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1126622489, now seen corresponding path program 1 times [2019-09-10 03:36:19,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:19,203 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:36:19,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:19,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:19,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:19,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:19,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:19,204 INFO L87 Difference]: Start difference. First operand 457 states and 641 transitions. Second operand 6 states. [2019-09-10 03:36:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:19,233 INFO L93 Difference]: Finished difference Result 488 states and 691 transitions. [2019-09-10 03:36:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:19,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:19,236 INFO L225 Difference]: With dead ends: 488 [2019-09-10 03:36:19,236 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 03:36:19,237 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:36:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 03:36:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2019-09-10 03:36:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-10 03:36:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 646 transitions. [2019-09-10 03:36:19,247 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 646 transitions. Word has length 218 [2019-09-10 03:36:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:19,247 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 646 transitions. [2019-09-10 03:36:19,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 646 transitions. [2019-09-10 03:36:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:19,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:19,249 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] [2019-09-10 03:36:19,249 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash -179584603, now seen corresponding path program 1 times [2019-09-10 03:36:19,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:19,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:19,345 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:36:19,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:19,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:19,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:19,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:19,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:19,346 INFO L87 Difference]: Start difference. First operand 462 states and 646 transitions. Second operand 6 states. [2019-09-10 03:36:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:19,375 INFO L93 Difference]: Finished difference Result 490 states and 691 transitions. [2019-09-10 03:36:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:19,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:19,378 INFO L225 Difference]: With dead ends: 490 [2019-09-10 03:36:19,378 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 03:36:19,378 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:36:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 03:36:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 467. [2019-09-10 03:36:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-10 03:36:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 651 transitions. [2019-09-10 03:36:19,388 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 651 transitions. Word has length 218 [2019-09-10 03:36:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:19,389 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 651 transitions. [2019-09-10 03:36:19,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 651 transitions. [2019-09-10 03:36:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:19,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:19,390 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] [2019-09-10 03:36:19,391 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1749347623, now seen corresponding path program 1 times [2019-09-10 03:36:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:19,511 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:36:19,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:19,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:19,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:19,514 INFO L87 Difference]: Start difference. First operand 467 states and 651 transitions. Second operand 4 states. [2019-09-10 03:36:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:19,983 INFO L93 Difference]: Finished difference Result 897 states and 1246 transitions. [2019-09-10 03:36:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:19,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:36:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:19,988 INFO L225 Difference]: With dead ends: 897 [2019-09-10 03:36:19,989 INFO L226 Difference]: Without dead ends: 897 [2019-09-10 03:36:19,989 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:36:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-10 03:36:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 891. [2019-09-10 03:36:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-10 03:36:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1241 transitions. [2019-09-10 03:36:20,010 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1241 transitions. Word has length 218 [2019-09-10 03:36:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,010 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1241 transitions. [2019-09-10 03:36:20,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1241 transitions. [2019-09-10 03:36:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:20,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,012 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] [2019-09-10 03:36:20,013 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1542993978, now seen corresponding path program 1 times [2019-09-10 03:36:20,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,122 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:36:20,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,124 INFO L87 Difference]: Start difference. First operand 891 states and 1241 transitions. Second operand 6 states. [2019-09-10 03:36:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,158 INFO L93 Difference]: Finished difference Result 916 states and 1279 transitions. [2019-09-10 03:36:20,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,163 INFO L225 Difference]: With dead ends: 916 [2019-09-10 03:36:20,164 INFO L226 Difference]: Without dead ends: 916 [2019-09-10 03:36:20,164 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:36:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2019-09-10 03:36:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 896. [2019-09-10 03:36:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-10 03:36:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1245 transitions. [2019-09-10 03:36:20,196 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1245 transitions. Word has length 218 [2019-09-10 03:36:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,197 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1245 transitions. [2019-09-10 03:36:20,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1245 transitions. [2019-09-10 03:36:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:20,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,199 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] [2019-09-10 03:36:20,199 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2128691716, now seen corresponding path program 1 times [2019-09-10 03:36:20,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,292 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:36:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:20,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:20,293 INFO L87 Difference]: Start difference. First operand 896 states and 1245 transitions. Second operand 4 states. [2019-09-10 03:36:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,697 INFO L93 Difference]: Finished difference Result 1749 states and 2424 transitions. [2019-09-10 03:36:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:20,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:36:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,705 INFO L225 Difference]: With dead ends: 1749 [2019-09-10 03:36:20,705 INFO L226 Difference]: Without dead ends: 1749 [2019-09-10 03:36:20,706 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:36:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-09-10 03:36:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1741. [2019-09-10 03:36:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 03:36:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2417 transitions. [2019-09-10 03:36:20,746 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2417 transitions. Word has length 218 [2019-09-10 03:36:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,747 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2417 transitions. [2019-09-10 03:36:20,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2417 transitions. [2019-09-10 03:36:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:20,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,749 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] [2019-09-10 03:36:20,749 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 149104773, now seen corresponding path program 1 times [2019-09-10 03:36:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,839 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:36:20,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,840 INFO L87 Difference]: Start difference. First operand 1741 states and 2417 transitions. Second operand 6 states. [2019-09-10 03:36:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,869 INFO L93 Difference]: Finished difference Result 1785 states and 2483 transitions. [2019-09-10 03:36:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,877 INFO L225 Difference]: With dead ends: 1785 [2019-09-10 03:36:20,877 INFO L226 Difference]: Without dead ends: 1785 [2019-09-10 03:36:20,878 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:36:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-09-10 03:36:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1751. [2019-09-10 03:36:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2019-09-10 03:36:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2425 transitions. [2019-09-10 03:36:20,916 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2425 transitions. Word has length 218 [2019-09-10 03:36:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,917 INFO L475 AbstractCegarLoop]: Abstraction has 1751 states and 2425 transitions. [2019-09-10 03:36:20,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2425 transitions. [2019-09-10 03:36:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:20,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:20,919 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1750175879, now seen corresponding path program 1 times [2019-09-10 03:36:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:21,031 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:36:21,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:21,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:21,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:21,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:21,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:21,036 INFO L87 Difference]: Start difference. First operand 1751 states and 2425 transitions. Second operand 4 states. [2019-09-10 03:36:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:21,477 INFO L93 Difference]: Finished difference Result 3447 states and 4766 transitions. [2019-09-10 03:36:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:21,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:36:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:21,492 INFO L225 Difference]: With dead ends: 3447 [2019-09-10 03:36:21,492 INFO L226 Difference]: Without dead ends: 3447 [2019-09-10 03:36:21,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:36:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2019-09-10 03:36:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3435. [2019-09-10 03:36:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-09-10 03:36:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4755 transitions. [2019-09-10 03:36:21,579 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4755 transitions. Word has length 218 [2019-09-10 03:36:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:21,579 INFO L475 AbstractCegarLoop]: Abstraction has 3435 states and 4755 transitions. [2019-09-10 03:36:21,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4755 transitions. [2019-09-10 03:36:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:21,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:21,581 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] [2019-09-10 03:36:21,581 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2023171302, now seen corresponding path program 1 times [2019-09-10 03:36:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:21,669 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:36:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:21,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:21,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:21,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:21,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:21,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:21,671 INFO L87 Difference]: Start difference. First operand 3435 states and 4755 transitions. Second operand 6 states. [2019-09-10 03:36:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:21,711 INFO L93 Difference]: Finished difference Result 3511 states and 4867 transitions. [2019-09-10 03:36:21,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:21,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:21,737 INFO L225 Difference]: With dead ends: 3511 [2019-09-10 03:36:21,738 INFO L226 Difference]: Without dead ends: 3511 [2019-09-10 03:36:21,738 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:36:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2019-09-10 03:36:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3455. [2019-09-10 03:36:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3455 states. [2019-09-10 03:36:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4771 transitions. [2019-09-10 03:36:21,851 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4771 transitions. Word has length 218 [2019-09-10 03:36:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:21,851 INFO L475 AbstractCegarLoop]: Abstraction has 3455 states and 4771 transitions. [2019-09-10 03:36:21,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4771 transitions. [2019-09-10 03:36:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:21,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:21,854 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] [2019-09-10 03:36:21,855 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1028477604, now seen corresponding path program 1 times [2019-09-10 03:36:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:21,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:21,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:21,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:21,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:21,985 INFO L87 Difference]: Start difference. First operand 3455 states and 4771 transitions. Second operand 6 states. [2019-09-10 03:36:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:22,030 INFO L93 Difference]: Finished difference Result 3583 states and 4964 transitions. [2019-09-10 03:36:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:22,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:22,045 INFO L225 Difference]: With dead ends: 3583 [2019-09-10 03:36:22,045 INFO L226 Difference]: Without dead ends: 3583 [2019-09-10 03:36:22,046 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:36:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2019-09-10 03:36:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3495. [2019-09-10 03:36:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2019-09-10 03:36:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 4811 transitions. [2019-09-10 03:36:22,114 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 4811 transitions. Word has length 218 [2019-09-10 03:36:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:22,114 INFO L475 AbstractCegarLoop]: Abstraction has 3495 states and 4811 transitions. [2019-09-10 03:36:22,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 4811 transitions. [2019-09-10 03:36:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:22,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:22,116 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] [2019-09-10 03:36:22,116 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:22,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:22,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1268717350, now seen corresponding path program 1 times [2019-09-10 03:36:22,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:22,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:22,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:22,202 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:36:22,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:22,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:22,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:22,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:22,204 INFO L87 Difference]: Start difference. First operand 3495 states and 4811 transitions. Second operand 6 states. [2019-09-10 03:36:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:22,241 INFO L93 Difference]: Finished difference Result 3599 states and 4964 transitions. [2019-09-10 03:36:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:22,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:22,252 INFO L225 Difference]: With dead ends: 3599 [2019-09-10 03:36:22,253 INFO L226 Difference]: Without dead ends: 3599 [2019-09-10 03:36:22,253 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:36:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2019-09-10 03:36:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3535. [2019-09-10 03:36:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2019-09-10 03:36:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4851 transitions. [2019-09-10 03:36:22,316 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4851 transitions. Word has length 218 [2019-09-10 03:36:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:22,316 INFO L475 AbstractCegarLoop]: Abstraction has 3535 states and 4851 transitions. [2019-09-10 03:36:22,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4851 transitions. [2019-09-10 03:36:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:22,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:22,318 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] [2019-09-10 03:36:22,318 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1117792156, now seen corresponding path program 1 times [2019-09-10 03:36:22,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:22,406 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:36:22,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:22,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:22,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:22,408 INFO L87 Difference]: Start difference. First operand 3535 states and 4851 transitions. Second operand 4 states. [2019-09-10 03:36:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:22,800 INFO L93 Difference]: Finished difference Result 6991 states and 9588 transitions. [2019-09-10 03:36:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:22,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:36:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:22,824 INFO L225 Difference]: With dead ends: 6991 [2019-09-10 03:36:22,824 INFO L226 Difference]: Without dead ends: 6991 [2019-09-10 03:36:22,824 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:36:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2019-09-10 03:36:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6971. [2019-09-10 03:36:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6971 states. [2019-09-10 03:36:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 9569 transitions. [2019-09-10 03:36:22,947 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 9569 transitions. Word has length 218 [2019-09-10 03:36:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:22,949 INFO L475 AbstractCegarLoop]: Abstraction has 6971 states and 9569 transitions. [2019-09-10 03:36:22,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 9569 transitions. [2019-09-10 03:36:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:22,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:22,951 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] [2019-09-10 03:36:22,952 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702117, now seen corresponding path program 1 times [2019-09-10 03:36:22,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:23,054 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:36:23,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:23,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:23,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:23,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:23,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:23,056 INFO L87 Difference]: Start difference. First operand 6971 states and 9569 transitions. Second operand 6 states. [2019-09-10 03:36:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:23,109 INFO L93 Difference]: Finished difference Result 7051 states and 9673 transitions. [2019-09-10 03:36:23,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:23,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:23,150 INFO L225 Difference]: With dead ends: 7051 [2019-09-10 03:36:23,150 INFO L226 Difference]: Without dead ends: 7051 [2019-09-10 03:36:23,151 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:36:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7051 states. [2019-09-10 03:36:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7051 to 7011. [2019-09-10 03:36:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7011 states. [2019-09-10 03:36:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7011 states to 7011 states and 9601 transitions. [2019-09-10 03:36:23,390 INFO L78 Accepts]: Start accepts. Automaton has 7011 states and 9601 transitions. Word has length 218 [2019-09-10 03:36:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:23,390 INFO L475 AbstractCegarLoop]: Abstraction has 7011 states and 9601 transitions. [2019-09-10 03:36:23,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7011 states and 9601 transitions. [2019-09-10 03:36:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:23,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:23,392 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] [2019-09-10 03:36:23,392 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1313690521, now seen corresponding path program 1 times [2019-09-10 03:36:23,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:23,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:23,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:23,497 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:36:23,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:23,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:23,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:23,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:23,499 INFO L87 Difference]: Start difference. First operand 7011 states and 9601 transitions. Second operand 4 states. [2019-09-10 03:36:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:23,934 INFO L93 Difference]: Finished difference Result 13895 states and 19046 transitions. [2019-09-10 03:36:23,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:23,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-10 03:36:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:23,980 INFO L225 Difference]: With dead ends: 13895 [2019-09-10 03:36:23,980 INFO L226 Difference]: Without dead ends: 13895 [2019-09-10 03:36:23,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:36:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13895 states. [2019-09-10 03:36:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13895 to 13859. [2019-09-10 03:36:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13859 states. [2019-09-10 03:36:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 19011 transitions. [2019-09-10 03:36:24,219 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 19011 transitions. Word has length 218 [2019-09-10 03:36:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:24,219 INFO L475 AbstractCegarLoop]: Abstraction has 13859 states and 19011 transitions. [2019-09-10 03:36:24,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 19011 transitions. [2019-09-10 03:36:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:24,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:24,221 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] [2019-09-10 03:36:24,221 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1839629382, now seen corresponding path program 1 times [2019-09-10 03:36:24,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:24,311 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:36:24,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:24,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:24,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:24,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:24,313 INFO L87 Difference]: Start difference. First operand 13859 states and 19011 transitions. Second operand 6 states. [2019-09-10 03:36:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:24,389 INFO L93 Difference]: Finished difference Result 13971 states and 19139 transitions. [2019-09-10 03:36:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:24,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-10 03:36:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:24,427 INFO L225 Difference]: With dead ends: 13971 [2019-09-10 03:36:24,427 INFO L226 Difference]: Without dead ends: 13971 [2019-09-10 03:36:24,428 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:36:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13971 states. [2019-09-10 03:36:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13971 to 13939. [2019-09-10 03:36:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13939 states. [2019-09-10 03:36:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13939 states to 13939 states and 19075 transitions. [2019-09-10 03:36:24,668 INFO L78 Accepts]: Start accepts. Automaton has 13939 states and 19075 transitions. Word has length 218 [2019-09-10 03:36:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:24,668 INFO L475 AbstractCegarLoop]: Abstraction has 13939 states and 19075 transitions. [2019-09-10 03:36:24,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 13939 states and 19075 transitions. [2019-09-10 03:36:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:24,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:24,670 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] [2019-09-10 03:36:24,670 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash -916997884, now seen corresponding path program 1 times [2019-09-10 03:36:24,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:25,307 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:36:25,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:25,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:25,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:25,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:25,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:25,308 INFO L87 Difference]: Start difference. First operand 13939 states and 19075 transitions. Second operand 5 states. [2019-09-10 03:36:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:26,430 INFO L93 Difference]: Finished difference Result 20627 states and 27766 transitions. [2019-09-10 03:36:26,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:26,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:26,485 INFO L225 Difference]: With dead ends: 20627 [2019-09-10 03:36:26,485 INFO L226 Difference]: Without dead ends: 20627 [2019-09-10 03:36:26,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20627 states. [2019-09-10 03:36:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20627 to 19315. [2019-09-10 03:36:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2019-09-10 03:36:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 25219 transitions. [2019-09-10 03:36:26,884 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 25219 transitions. Word has length 218 [2019-09-10 03:36:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:26,885 INFO L475 AbstractCegarLoop]: Abstraction has 19315 states and 25219 transitions. [2019-09-10 03:36:26,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 25219 transitions. [2019-09-10 03:36:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:26,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:26,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:26,887 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1022164162, now seen corresponding path program 1 times [2019-09-10 03:36:26,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:26,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:26,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:27,001 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:36:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:27,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:27,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:27,003 INFO L87 Difference]: Start difference. First operand 19315 states and 25219 transitions. Second operand 5 states. [2019-09-10 03:36:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:27,836 INFO L93 Difference]: Finished difference Result 19315 states and 25155 transitions. [2019-09-10 03:36:27,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:27,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:27,883 INFO L225 Difference]: With dead ends: 19315 [2019-09-10 03:36:27,883 INFO L226 Difference]: Without dead ends: 19315 [2019-09-10 03:36:27,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:36:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19315 states. [2019-09-10 03:36:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19315 to 19315. [2019-09-10 03:36:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2019-09-10 03:36:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 25155 transitions. [2019-09-10 03:36:28,273 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 25155 transitions. Word has length 218 [2019-09-10 03:36:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:28,273 INFO L475 AbstractCegarLoop]: Abstraction has 19315 states and 25155 transitions. [2019-09-10 03:36:28,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 25155 transitions. [2019-09-10 03:36:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:28,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:28,275 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] [2019-09-10 03:36:28,276 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:28,276 INFO L82 PathProgramCache]: Analyzing trace with hash 669075780, now seen corresponding path program 1 times [2019-09-10 03:36:28,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:28,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:28,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:28,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:28,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:28,391 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:36:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:28,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:28,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:28,393 INFO L87 Difference]: Start difference. First operand 19315 states and 25155 transitions. Second operand 5 states. [2019-09-10 03:36:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:29,209 INFO L93 Difference]: Finished difference Result 19315 states and 25091 transitions. [2019-09-10 03:36:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:29,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:29,251 INFO L225 Difference]: With dead ends: 19315 [2019-09-10 03:36:29,251 INFO L226 Difference]: Without dead ends: 19315 [2019-09-10 03:36:29,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:36:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19315 states. [2019-09-10 03:36:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19315 to 19315. [2019-09-10 03:36:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2019-09-10 03:36:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 25091 transitions. [2019-09-10 03:36:29,525 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 25091 transitions. Word has length 218 [2019-09-10 03:36:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:29,526 INFO L475 AbstractCegarLoop]: Abstraction has 19315 states and 25091 transitions. [2019-09-10 03:36:29,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 25091 transitions. [2019-09-10 03:36:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:29,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:29,528 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] [2019-09-10 03:36:29,528 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1697618814, now seen corresponding path program 1 times [2019-09-10 03:36:29,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:29,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:29,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:29,635 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:36:29,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:29,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:29,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:29,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:29,636 INFO L87 Difference]: Start difference. First operand 19315 states and 25091 transitions. Second operand 5 states. [2019-09-10 03:36:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:30,533 INFO L93 Difference]: Finished difference Result 19315 states and 25027 transitions. [2019-09-10 03:36:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:30,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:30,573 INFO L225 Difference]: With dead ends: 19315 [2019-09-10 03:36:30,574 INFO L226 Difference]: Without dead ends: 19315 [2019-09-10 03:36:30,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:36:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19315 states. [2019-09-10 03:36:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19315 to 19315. [2019-09-10 03:36:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2019-09-10 03:36:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 25027 transitions. [2019-09-10 03:36:30,892 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 25027 transitions. Word has length 218 [2019-09-10 03:36:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:30,892 INFO L475 AbstractCegarLoop]: Abstraction has 19315 states and 25027 transitions. [2019-09-10 03:36:30,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 25027 transitions. [2019-09-10 03:36:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:30,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:30,895 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] [2019-09-10 03:36:30,895 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 547960640, now seen corresponding path program 1 times [2019-09-10 03:36:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:30,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:30,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:31,019 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:36:31,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:31,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:31,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:31,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:31,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:31,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:31,020 INFO L87 Difference]: Start difference. First operand 19315 states and 25027 transitions. Second operand 5 states. [2019-09-10 03:36:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:31,930 INFO L93 Difference]: Finished difference Result 19315 states and 24963 transitions. [2019-09-10 03:36:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:31,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:31,971 INFO L225 Difference]: With dead ends: 19315 [2019-09-10 03:36:31,971 INFO L226 Difference]: Without dead ends: 19315 [2019-09-10 03:36:31,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:36:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19315 states. [2019-09-10 03:36:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19315 to 19315. [2019-09-10 03:36:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2019-09-10 03:36:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 24963 transitions. [2019-09-10 03:36:32,237 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 24963 transitions. Word has length 218 [2019-09-10 03:36:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:32,237 INFO L475 AbstractCegarLoop]: Abstraction has 19315 states and 24963 transitions. [2019-09-10 03:36:32,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 24963 transitions. [2019-09-10 03:36:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:32,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:32,239 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] [2019-09-10 03:36:32,239 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -349432638, now seen corresponding path program 1 times [2019-09-10 03:36:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:32,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:32,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:32,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:32,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:32,493 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:36:32,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:32,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:32,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:32,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:32,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:32,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:32,494 INFO L87 Difference]: Start difference. First operand 19315 states and 24963 transitions. Second operand 5 states. [2019-09-10 03:36:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:33,659 INFO L93 Difference]: Finished difference Result 26773 states and 34492 transitions. [2019-09-10 03:36:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:33,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:33,700 INFO L225 Difference]: With dead ends: 26773 [2019-09-10 03:36:33,700 INFO L226 Difference]: Without dead ends: 26773 [2019-09-10 03:36:33,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26773 states. [2019-09-10 03:36:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26773 to 26197. [2019-09-10 03:36:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26197 states. [2019-09-10 03:36:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26197 states to 26197 states and 33321 transitions. [2019-09-10 03:36:34,006 INFO L78 Accepts]: Start accepts. Automaton has 26197 states and 33321 transitions. Word has length 218 [2019-09-10 03:36:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:34,006 INFO L475 AbstractCegarLoop]: Abstraction has 26197 states and 33321 transitions. [2019-09-10 03:36:34,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 26197 states and 33321 transitions. [2019-09-10 03:36:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:34,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:34,009 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] [2019-09-10 03:36:34,009 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash -101286144, now seen corresponding path program 1 times [2019-09-10 03:36:34,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:34,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:34,119 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:36:34,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:34,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:34,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:34,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:34,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:34,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:34,121 INFO L87 Difference]: Start difference. First operand 26197 states and 33321 transitions. Second operand 5 states. [2019-09-10 03:36:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:35,019 INFO L93 Difference]: Finished difference Result 26197 states and 33225 transitions. [2019-09-10 03:36:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:35,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:35,058 INFO L225 Difference]: With dead ends: 26197 [2019-09-10 03:36:35,059 INFO L226 Difference]: Without dead ends: 26197 [2019-09-10 03:36:35,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:36:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26197 states. [2019-09-10 03:36:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26197 to 26197. [2019-09-10 03:36:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26197 states. [2019-09-10 03:36:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26197 states to 26197 states and 33225 transitions. [2019-09-10 03:36:35,446 INFO L78 Accepts]: Start accepts. Automaton has 26197 states and 33225 transitions. Word has length 218 [2019-09-10 03:36:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:35,446 INFO L475 AbstractCegarLoop]: Abstraction has 26197 states and 33225 transitions. [2019-09-10 03:36:35,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 26197 states and 33225 transitions. [2019-09-10 03:36:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:35,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:35,449 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] [2019-09-10 03:36:35,449 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 322360578, now seen corresponding path program 1 times [2019-09-10 03:36:35,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:35,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:35,552 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:36:35,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:35,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:35,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:35,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:35,554 INFO L87 Difference]: Start difference. First operand 26197 states and 33225 transitions. Second operand 5 states. [2019-09-10 03:36:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:36,458 INFO L93 Difference]: Finished difference Result 26197 states and 33129 transitions. [2019-09-10 03:36:36,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:36,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:36,497 INFO L225 Difference]: With dead ends: 26197 [2019-09-10 03:36:36,497 INFO L226 Difference]: Without dead ends: 26197 [2019-09-10 03:36:36,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:36:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26197 states. [2019-09-10 03:36:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26197 to 26197. [2019-09-10 03:36:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26197 states. [2019-09-10 03:36:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26197 states to 26197 states and 33129 transitions. [2019-09-10 03:36:36,775 INFO L78 Accepts]: Start accepts. Automaton has 26197 states and 33129 transitions. Word has length 218 [2019-09-10 03:36:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:36,775 INFO L475 AbstractCegarLoop]: Abstraction has 26197 states and 33129 transitions. [2019-09-10 03:36:36,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26197 states and 33129 transitions. [2019-09-10 03:36:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:36,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:36,777 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] [2019-09-10 03:36:36,777 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1049446720, now seen corresponding path program 1 times [2019-09-10 03:36:36,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:36,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:36,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:36,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:36,877 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:36:36,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:36,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:36,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:36,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:36,879 INFO L87 Difference]: Start difference. First operand 26197 states and 33129 transitions. Second operand 5 states. [2019-09-10 03:36:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:37,810 INFO L93 Difference]: Finished difference Result 26197 states and 33033 transitions. [2019-09-10 03:36:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:37,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:37,995 INFO L225 Difference]: With dead ends: 26197 [2019-09-10 03:36:37,995 INFO L226 Difference]: Without dead ends: 26197 [2019-09-10 03:36:37,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:36:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26197 states. [2019-09-10 03:36:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26197 to 26197. [2019-09-10 03:36:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26197 states. [2019-09-10 03:36:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26197 states to 26197 states and 33033 transitions. [2019-09-10 03:36:38,218 INFO L78 Accepts]: Start accepts. Automaton has 26197 states and 33033 transitions. Word has length 218 [2019-09-10 03:36:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:38,218 INFO L475 AbstractCegarLoop]: Abstraction has 26197 states and 33033 transitions. [2019-09-10 03:36:38,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26197 states and 33033 transitions. [2019-09-10 03:36:38,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:38,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:38,220 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] [2019-09-10 03:36:38,220 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1400153410, now seen corresponding path program 1 times [2019-09-10 03:36:38,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:38,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:38,323 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:36:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:38,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:38,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:38,325 INFO L87 Difference]: Start difference. First operand 26197 states and 33033 transitions. Second operand 5 states. [2019-09-10 03:36:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:39,226 INFO L93 Difference]: Finished difference Result 26197 states and 32937 transitions. [2019-09-10 03:36:39,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:39,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:39,267 INFO L225 Difference]: With dead ends: 26197 [2019-09-10 03:36:39,267 INFO L226 Difference]: Without dead ends: 26197 [2019-09-10 03:36:39,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:36:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26197 states. [2019-09-10 03:36:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26197 to 26197. [2019-09-10 03:36:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26197 states. [2019-09-10 03:36:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26197 states to 26197 states and 32937 transitions. [2019-09-10 03:36:39,507 INFO L78 Accepts]: Start accepts. Automaton has 26197 states and 32937 transitions. Word has length 218 [2019-09-10 03:36:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:39,508 INFO L475 AbstractCegarLoop]: Abstraction has 26197 states and 32937 transitions. [2019-09-10 03:36:39,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26197 states and 32937 transitions. [2019-09-10 03:36:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:39,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:39,510 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] [2019-09-10 03:36:39,510 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 370794112, now seen corresponding path program 1 times [2019-09-10 03:36:39,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:39,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:39,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:39,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:39,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:39,612 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:36:39,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:39,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:39,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:39,614 INFO L87 Difference]: Start difference. First operand 26197 states and 32937 transitions. Second operand 5 states. [2019-09-10 03:36:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:41,134 INFO L93 Difference]: Finished difference Result 32085 states and 40509 transitions. [2019-09-10 03:36:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:41,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:41,213 INFO L225 Difference]: With dead ends: 32085 [2019-09-10 03:36:41,213 INFO L226 Difference]: Without dead ends: 32085 [2019-09-10 03:36:41,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32085 states. [2019-09-10 03:36:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32085 to 28565. [2019-09-10 03:36:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28565 states. [2019-09-10 03:36:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28565 states to 28565 states and 35465 transitions. [2019-09-10 03:36:41,544 INFO L78 Accepts]: Start accepts. Automaton has 28565 states and 35465 transitions. Word has length 218 [2019-09-10 03:36:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:41,544 INFO L475 AbstractCegarLoop]: Abstraction has 28565 states and 35465 transitions. [2019-09-10 03:36:41,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28565 states and 35465 transitions. [2019-09-10 03:36:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:41,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:41,546 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] [2019-09-10 03:36:41,546 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -23572674, now seen corresponding path program 1 times [2019-09-10 03:36:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:41,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:41,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:41,637 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:36:41,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:41,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:41,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:41,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:41,638 INFO L87 Difference]: Start difference. First operand 28565 states and 35465 transitions. Second operand 5 states. [2019-09-10 03:36:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:43,042 INFO L93 Difference]: Finished difference Result 39781 states and 50194 transitions. [2019-09-10 03:36:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:43,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:43,107 INFO L225 Difference]: With dead ends: 39781 [2019-09-10 03:36:43,108 INFO L226 Difference]: Without dead ends: 39781 [2019-09-10 03:36:43,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39781 states. [2019-09-10 03:36:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39781 to 33317. [2019-09-10 03:36:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33317 states. [2019-09-10 03:36:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33317 states to 33317 states and 40729 transitions. [2019-09-10 03:36:44,551 INFO L78 Accepts]: Start accepts. Automaton has 33317 states and 40729 transitions. Word has length 218 [2019-09-10 03:36:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:44,552 INFO L475 AbstractCegarLoop]: Abstraction has 33317 states and 40729 transitions. [2019-09-10 03:36:44,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 33317 states and 40729 transitions. [2019-09-10 03:36:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:44,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:44,554 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] [2019-09-10 03:36:44,554 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -867578176, now seen corresponding path program 1 times [2019-09-10 03:36:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:44,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:44,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:44,661 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:36:44,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:44,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:44,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:44,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:44,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:44,663 INFO L87 Difference]: Start difference. First operand 33317 states and 40729 transitions. Second operand 5 states. [2019-09-10 03:36:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:46,047 INFO L93 Difference]: Finished difference Result 55323 states and 68537 transitions. [2019-09-10 03:36:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:36:46,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:46,157 INFO L225 Difference]: With dead ends: 55323 [2019-09-10 03:36:46,157 INFO L226 Difference]: Without dead ends: 55323 [2019-09-10 03:36:46,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:36:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55323 states. [2019-09-10 03:36:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55323 to 45305. [2019-09-10 03:36:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45305 states. [2019-09-10 03:36:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45305 states to 45305 states and 54937 transitions. [2019-09-10 03:36:46,644 INFO L78 Accepts]: Start accepts. Automaton has 45305 states and 54937 transitions. Word has length 218 [2019-09-10 03:36:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:46,644 INFO L475 AbstractCegarLoop]: Abstraction has 45305 states and 54937 transitions. [2019-09-10 03:36:46,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 45305 states and 54937 transitions. [2019-09-10 03:36:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 03:36:46,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:46,646 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] [2019-09-10 03:36:46,646 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash -387893313, now seen corresponding path program 1 times [2019-09-10 03:36:46,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:46,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:46,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:46,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:46,757 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:36:46,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:46,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:46,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:46,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:46,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:46,759 INFO L87 Difference]: Start difference. First operand 45305 states and 54937 transitions. Second operand 5 states. [2019-09-10 03:36:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:47,982 INFO L93 Difference]: Finished difference Result 39861 states and 49986 transitions. [2019-09-10 03:36:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:47,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-10 03:36:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:48,044 INFO L225 Difference]: With dead ends: 39861 [2019-09-10 03:36:48,044 INFO L226 Difference]: Without dead ends: 39861 [2019-09-10 03:36:48,044 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:36:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39861 states. [2019-09-10 03:36:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39861 to 37749. [2019-09-10 03:36:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37749 states. [2019-09-10 03:36:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37749 states to 37749 states and 45481 transitions. [2019-09-10 03:36:48,414 INFO L78 Accepts]: Start accepts. Automaton has 37749 states and 45481 transitions. Word has length 219 [2019-09-10 03:36:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:48,414 INFO L475 AbstractCegarLoop]: Abstraction has 37749 states and 45481 transitions. [2019-09-10 03:36:48,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37749 states and 45481 transitions. [2019-09-10 03:36:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:48,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:48,416 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] [2019-09-10 03:36:48,416 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1183405822, now seen corresponding path program 1 times [2019-09-10 03:36:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:48,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:48,511 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:36:48,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:48,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:48,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:48,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:48,512 INFO L87 Difference]: Start difference. First operand 37749 states and 45481 transitions. Second operand 5 states. [2019-09-10 03:36:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:49,948 INFO L93 Difference]: Finished difference Result 47493 states and 58322 transitions. [2019-09-10 03:36:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:49,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:50,032 INFO L225 Difference]: With dead ends: 47493 [2019-09-10 03:36:50,032 INFO L226 Difference]: Without dead ends: 47493 [2019-09-10 03:36:50,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47493 states. [2019-09-10 03:36:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47493 to 41861. [2019-09-10 03:36:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41861 states. [2019-09-10 03:36:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41861 states to 41861 states and 49849 transitions. [2019-09-10 03:36:50,466 INFO L78 Accepts]: Start accepts. Automaton has 41861 states and 49849 transitions. Word has length 218 [2019-09-10 03:36:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:50,466 INFO L475 AbstractCegarLoop]: Abstraction has 41861 states and 49849 transitions. [2019-09-10 03:36:50,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 41861 states and 49849 transitions. [2019-09-10 03:36:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:50,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:50,468 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] [2019-09-10 03:36:50,468 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1111019264, now seen corresponding path program 1 times [2019-09-10 03:36:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:50,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:50,590 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:36:50,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:50,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:50,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:50,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:50,591 INFO L87 Difference]: Start difference. First operand 41861 states and 49849 transitions. Second operand 5 states. [2019-09-10 03:36:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:52,125 INFO L93 Difference]: Finished difference Result 50805 states and 61666 transitions. [2019-09-10 03:36:52,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:52,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:52,209 INFO L225 Difference]: With dead ends: 50805 [2019-09-10 03:36:52,210 INFO L226 Difference]: Without dead ends: 50805 [2019-09-10 03:36:52,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50805 states. [2019-09-10 03:36:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50805 to 45653. [2019-09-10 03:36:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45653 states. [2019-09-10 03:36:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45653 states to 45653 states and 53769 transitions. [2019-09-10 03:36:52,674 INFO L78 Accepts]: Start accepts. Automaton has 45653 states and 53769 transitions. Word has length 218 [2019-09-10 03:36:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:52,674 INFO L475 AbstractCegarLoop]: Abstraction has 45653 states and 53769 transitions. [2019-09-10 03:36:52,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 45653 states and 53769 transitions. [2019-09-10 03:36:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:52,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:52,675 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] [2019-09-10 03:36:52,676 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1385778878, now seen corresponding path program 1 times [2019-09-10 03:36:52,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:52,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:52,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:52,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:52,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:52,773 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:36:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:52,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:52,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:52,774 INFO L87 Difference]: Start difference. First operand 45653 states and 53769 transitions. Second operand 5 states. [2019-09-10 03:36:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:54,185 INFO L93 Difference]: Finished difference Result 51757 states and 62458 transitions. [2019-09-10 03:36:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:54,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:54,276 INFO L225 Difference]: With dead ends: 51757 [2019-09-10 03:36:54,276 INFO L226 Difference]: Without dead ends: 51757 [2019-09-10 03:36:54,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51757 states. [2019-09-10 03:36:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51757 to 49629. [2019-09-10 03:36:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49629 states. [2019-09-10 03:36:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49629 states to 49629 states and 57937 transitions. [2019-09-10 03:36:54,971 INFO L78 Accepts]: Start accepts. Automaton has 49629 states and 57937 transitions. Word has length 218 [2019-09-10 03:36:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:54,971 INFO L475 AbstractCegarLoop]: Abstraction has 49629 states and 57937 transitions. [2019-09-10 03:36:54,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 49629 states and 57937 transitions. [2019-09-10 03:36:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:54,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:54,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] [2019-09-10 03:36:54,973 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:54,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2087378752, now seen corresponding path program 1 times [2019-09-10 03:36:54,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:54,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:54,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:54,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:54,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:55,068 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:36:55,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:55,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:55,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:55,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:55,069 INFO L87 Difference]: Start difference. First operand 49629 states and 57937 transitions. Second operand 5 states. [2019-09-10 03:36:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:56,435 INFO L93 Difference]: Finished difference Result 52269 states and 61581 transitions. [2019-09-10 03:36:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:56,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:56,529 INFO L225 Difference]: With dead ends: 52269 [2019-09-10 03:36:56,529 INFO L226 Difference]: Without dead ends: 52269 [2019-09-10 03:36:56,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52269 states. [2019-09-10 03:36:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52269 to 51269. [2019-09-10 03:36:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51269 states. [2019-09-10 03:36:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51269 states to 51269 states and 59441 transitions. [2019-09-10 03:36:57,028 INFO L78 Accepts]: Start accepts. Automaton has 51269 states and 59441 transitions. Word has length 218 [2019-09-10 03:36:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:57,028 INFO L475 AbstractCegarLoop]: Abstraction has 51269 states and 59441 transitions. [2019-09-10 03:36:57,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 51269 states and 59441 transitions. [2019-09-10 03:36:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:57,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:57,029 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] [2019-09-10 03:36:57,029 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2110011006, now seen corresponding path program 1 times [2019-09-10 03:36:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:57,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:57,127 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:36:57,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:57,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:57,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:57,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:57,129 INFO L87 Difference]: Start difference. First operand 51269 states and 59441 transitions. Second operand 5 states. [2019-09-10 03:36:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:58,589 INFO L93 Difference]: Finished difference Result 53893 states and 62869 transitions. [2019-09-10 03:36:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:58,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:58,668 INFO L225 Difference]: With dead ends: 53893 [2019-09-10 03:36:58,668 INFO L226 Difference]: Without dead ends: 53893 [2019-09-10 03:36:58,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53893 states. [2019-09-10 03:36:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53893 to 52197. [2019-09-10 03:36:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52197 states. [2019-09-10 03:36:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52197 states to 52197 states and 59953 transitions. [2019-09-10 03:36:59,148 INFO L78 Accepts]: Start accepts. Automaton has 52197 states and 59953 transitions. Word has length 218 [2019-09-10 03:36:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:59,149 INFO L475 AbstractCegarLoop]: Abstraction has 52197 states and 59953 transitions. [2019-09-10 03:36:59,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 52197 states and 59953 transitions. [2019-09-10 03:36:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:59,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:59,150 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] [2019-09-10 03:36:59,150 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1600537916, now seen corresponding path program 1 times [2019-09-10 03:36:59,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:59,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:59,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:59,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:59,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:59,245 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:36:59,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:59,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:59,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:59,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:59,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:59,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:59,246 INFO L87 Difference]: Start difference. First operand 52197 states and 59953 transitions. Second operand 5 states. [2019-09-10 03:37:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:00,585 INFO L93 Difference]: Finished difference Result 58069 states and 68026 transitions. [2019-09-10 03:37:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:37:00,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:37:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:00,678 INFO L225 Difference]: With dead ends: 58069 [2019-09-10 03:37:00,678 INFO L226 Difference]: Without dead ends: 58069 [2019-09-10 03:37:00,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:37:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58069 states. [2019-09-10 03:37:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58069 to 55029. [2019-09-10 03:37:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55029 states. [2019-09-10 03:37:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55029 states to 55029 states and 62529 transitions. [2019-09-10 03:37:01,210 INFO L78 Accepts]: Start accepts. Automaton has 55029 states and 62529 transitions. Word has length 218 [2019-09-10 03:37:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:01,210 INFO L475 AbstractCegarLoop]: Abstraction has 55029 states and 62529 transitions. [2019-09-10 03:37:01,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 55029 states and 62529 transitions. [2019-09-10 03:37:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:37:01,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:01,212 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] [2019-09-10 03:37:01,212 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash -771201346, now seen corresponding path program 1 times [2019-09-10 03:37:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:01,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:01,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:01,623 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:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:01,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:01,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:01,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:01,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:01,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:01,625 INFO L87 Difference]: Start difference. First operand 55029 states and 62529 transitions. Second operand 5 states. [2019-09-10 03:37:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:02,882 INFO L93 Difference]: Finished difference Result 66393 states and 77136 transitions. [2019-09-10 03:37:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:37:02,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:37:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:02,987 INFO L225 Difference]: With dead ends: 66393 [2019-09-10 03:37:02,987 INFO L226 Difference]: Without dead ends: 66393 [2019-09-10 03:37:02,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:37:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66393 states. [2019-09-10 03:37:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66393 to 64265. [2019-09-10 03:37:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64265 states. [2019-09-10 03:37:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64265 states to 64265 states and 72551 transitions. [2019-09-10 03:37:03,608 INFO L78 Accepts]: Start accepts. Automaton has 64265 states and 72551 transitions. Word has length 218 [2019-09-10 03:37:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:03,608 INFO L475 AbstractCegarLoop]: Abstraction has 64265 states and 72551 transitions. [2019-09-10 03:37:03,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 64265 states and 72551 transitions. [2019-09-10 03:37:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:37:03,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:03,610 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] [2019-09-10 03:37:03,610 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -709161732, now seen corresponding path program 1 times [2019-09-10 03:37:03,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:03,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:03,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:03,690 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:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:03,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:03,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:03,691 INFO L87 Difference]: Start difference. First operand 64265 states and 72551 transitions. Second operand 5 states. [2019-09-10 03:37:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:04,961 INFO L93 Difference]: Finished difference Result 66361 states and 75531 transitions. [2019-09-10 03:37:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:37:04,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:37:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:05,079 INFO L225 Difference]: With dead ends: 66361 [2019-09-10 03:37:05,079 INFO L226 Difference]: Without dead ends: 66361 [2019-09-10 03:37:05,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:37:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66361 states. [2019-09-10 03:37:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66361 to 65297. [2019-09-10 03:37:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65297 states. [2019-09-10 03:37:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65297 states to 65297 states and 73135 transitions. [2019-09-10 03:37:05,997 INFO L78 Accepts]: Start accepts. Automaton has 65297 states and 73135 transitions. Word has length 218 [2019-09-10 03:37:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:05,998 INFO L475 AbstractCegarLoop]: Abstraction has 65297 states and 73135 transitions. [2019-09-10 03:37:05,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 65297 states and 73135 transitions. [2019-09-10 03:37:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:37:05,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:05,999 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] [2019-09-10 03:37:05,999 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash -568613122, now seen corresponding path program 1 times [2019-09-10 03:37:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:06,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:06,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:06,097 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:06,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:06,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:37:06,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:06,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:37:06,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:37:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:37:06,099 INFO L87 Difference]: Start difference. First operand 65297 states and 73135 transitions. Second operand 3 states. [2019-09-10 03:37:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:06,451 INFO L93 Difference]: Finished difference Result 129705 states and 147088 transitions. [2019-09-10 03:37:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:37:06,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-10 03:37:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:06,781 INFO L225 Difference]: With dead ends: 129705 [2019-09-10 03:37:06,782 INFO L226 Difference]: Without dead ends: 129705 [2019-09-10 03:37:06,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:37:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129705 states. [2019-09-10 03:37:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129705 to 129673. [2019-09-10 03:37:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129673 states. [2019-09-10 03:37:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129673 states to 129673 states and 147056 transitions. [2019-09-10 03:37:08,105 INFO L78 Accepts]: Start accepts. Automaton has 129673 states and 147056 transitions. Word has length 218 [2019-09-10 03:37:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:08,105 INFO L475 AbstractCegarLoop]: Abstraction has 129673 states and 147056 transitions. [2019-09-10 03:37:08,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:37:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 129673 states and 147056 transitions. [2019-09-10 03:37:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-10 03:37:08,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:08,151 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] [2019-09-10 03:37:08,151 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2096305319, now seen corresponding path program 1 times [2019-09-10 03:37:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:08,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-10 03:37:10,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:37:10,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:37:10,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 365 with the following transitions: [2019-09-10 03:37:10,504 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [277], [282], [285], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [857], [858], [859], [869], [871], [873], [874], [875], [878], [883], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1125], [1128], [1130], [1133], [1144], [1146], [1148], [1152], [1190], [1193], [1194], [1195], [1205], [1207], [1209], [1210], [1211], [1220], [1223], [1226], [1232], [1235], [1254], [1267], [1280], [1293], [1306], [1319], [1332], [1345], [1358], [1371], [1384], [1390], [1400], [1402], [1404], [1405], [1406], [1416], [1418], [1420], [1421], [1422], [1423], [1437], [1439], [1501], [1502], [1521], [1522], [1523], [1527], [1528], [1529], [1530], [1531], [1532], [1533], [1534], [1535], [1536], [1537], [1538], [1539], [1540], [1541], [1542], [1543], [1544], [1545], [1546], [1547], [1548], [1549], [1550], [1551], [1552], [1555], [1556], [1557], [1561], [1562], [1563], [1564], [1587], [1588], [1589], [1590], [1591], [1592], [1593], [1594], [1595], [1596], [1597], [1617], [1618], [1619] [2019-09-10 03:37:10,559 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:37:10,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:37:11,057 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:37:11,059 INFO L272 AbstractInterpreter]: Visited 227 different actions 338 times. Never merged. Never widened. Performed 2740 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2740 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:37:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:11,065 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:37:11,838 INFO L227 lantSequenceWeakener]: Weakened 347 states. On average, predicates are now at 72.68% of their original sizes. [2019-09-10 03:37:11,838 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:37:30,018 INFO L420 sIntCurrentIteration]: We unified 363 AI predicates to 363 [2019-09-10 03:37:30,018 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:37:30,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:37:30,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [163] imperfect sequences [4] total 165 [2019-09-10 03:37:30,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:30,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-10 03:37:30,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-10 03:37:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2368, Invalid=24038, Unknown=0, NotChecked=0, Total=26406 [2019-09-10 03:37:30,024 INFO L87 Difference]: Start difference. First operand 129673 states and 147056 transitions. Second operand 163 states. [2019-09-10 03:40:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:33,404 INFO L93 Difference]: Finished difference Result 134491 states and 153552 transitions. [2019-09-10 03:40:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-09-10 03:40:33,404 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 364 [2019-09-10 03:40:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:33,674 INFO L225 Difference]: With dead ends: 134491 [2019-09-10 03:40:33,674 INFO L226 Difference]: Without dead ends: 134491 [2019-09-10 03:40:33,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36765 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=9297, Invalid=105285, Unknown=0, NotChecked=0, Total=114582 [2019-09-10 03:40:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134491 states. [2019-09-10 03:40:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134491 to 133888. [2019-09-10 03:40:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133888 states. [2019-09-10 03:40:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133888 states to 133888 states and 152868 transitions. [2019-09-10 03:40:35,151 INFO L78 Accepts]: Start accepts. Automaton has 133888 states and 152868 transitions. Word has length 364 [2019-09-10 03:40:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:35,151 INFO L475 AbstractCegarLoop]: Abstraction has 133888 states and 152868 transitions. [2019-09-10 03:40:35,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-10 03:40:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 133888 states and 152868 transitions. [2019-09-10 03:40:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-10 03:40:35,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:35,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,209 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash 776510145, now seen corresponding path program 1 times [2019-09-10 03:40:35,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:35,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 03:40:35,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:40:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:40:35,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:35,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:40:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:40:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:40:35,357 INFO L87 Difference]: Start difference. First operand 133888 states and 152868 transitions. Second operand 5 states. [2019-09-10 03:40:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:37,423 INFO L93 Difference]: Finished difference Result 227789 states and 264236 transitions. [2019-09-10 03:40:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:40:37,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 370 [2019-09-10 03:40:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:38,007 INFO L225 Difference]: With dead ends: 227789 [2019-09-10 03:40:38,007 INFO L226 Difference]: Without dead ends: 169973 [2019-09-10 03:40:38,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:40:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169973 states. [2019-09-10 03:40:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169973 to 165685. [2019-09-10 03:40:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165685 states. [2019-09-10 03:40:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165685 states to 165685 states and 189309 transitions. [2019-09-10 03:40:44,761 INFO L78 Accepts]: Start accepts. Automaton has 165685 states and 189309 transitions. Word has length 370 [2019-09-10 03:40:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:44,762 INFO L475 AbstractCegarLoop]: Abstraction has 165685 states and 189309 transitions. [2019-09-10 03:40:44,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:40:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 165685 states and 189309 transitions. [2019-09-10 03:40:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-10 03:40:44,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:44,974 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,974 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 427581767, now seen corresponding path program 1 times [2019-09-10 03:40:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:44,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:44,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-10 03:40:45,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:45,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:45,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 526 with the following transitions: [2019-09-10 03:40:45,347 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [39], [41], [43], [44], [277], [282], [285], [288], [293], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [476], [479], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [673], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [800], [803], [857], [858], [859], [869], [871], [873], [874], [875], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1125], [1128], [1130], [1133], [1144], [1146], [1148], [1152], [1190], [1193], [1194], [1195], [1205], [1207], [1209], [1210], [1211], [1220], [1223], [1226], [1232], [1235], [1241], [1245], [1248], [1254], [1267], [1280], [1293], [1306], [1319], [1332], [1345], [1358], [1371], [1375], [1378], [1390], [1400], [1402], [1404], [1405], [1406], [1416], [1418], [1420], [1421], [1422], [1423], [1437], [1439], [1474], [1476], [1479], [1490], [1492], [1494], [1496], [1500], [1501], [1502], [1521], [1522], [1523], [1527], [1528], [1529], [1530], [1531], [1532], [1533], [1534], [1535], [1536], [1537], [1538], [1539], [1540], [1541], [1542], [1543], [1544], [1545], [1546], [1547], [1548], [1549], [1550], [1551], [1552], [1555], [1556], [1557], [1561], [1562], [1563], [1564], [1565], [1566], [1585], [1586], [1587], [1588], [1589], [1590], [1591], [1592], [1593], [1594], [1595], [1596], [1597], [1617], [1618], [1619], [1621], [1622] [2019-09-10 03:40:45,362 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:45,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:45,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:45,600 INFO L272 AbstractInterpreter]: Visited 240 different actions 353 times. Never merged. Never widened. Performed 2888 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2888 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:40:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:45,601 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:46,140 INFO L227 lantSequenceWeakener]: Weakened 367 states. On average, predicates are now at 71.34% of their original sizes. [2019-09-10 03:40:46,140 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:41:06,688 INFO L420 sIntCurrentIteration]: We unified 524 AI predicates to 524 [2019-09-10 03:41:06,688 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:41:06,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:41:06,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [162] imperfect sequences [5] total 165 [2019-09-10 03:41:06,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:41:06,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-10 03:41:06,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-10 03:41:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2003, Invalid=24079, Unknown=0, NotChecked=0, Total=26082 [2019-09-10 03:41:06,692 INFO L87 Difference]: Start difference. First operand 165685 states and 189309 transitions. Second operand 162 states. [2019-09-10 03:46:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:08,976 INFO L93 Difference]: Finished difference Result 167145 states and 190984 transitions. [2019-09-10 03:46:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-09-10 03:46:08,977 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 525 [2019-09-10 03:46:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:09,374 INFO L225 Difference]: With dead ends: 167145 [2019-09-10 03:46:09,374 INFO L226 Difference]: Without dead ends: 167145 [2019-09-10 03:46:09,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36719 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=7829, Invalid=108793, Unknown=0, NotChecked=0, Total=116622 [2019-09-10 03:46:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167145 states. [2019-09-10 03:46:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167145 to 166533. [2019-09-10 03:46:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166533 states. [2019-09-10 03:46:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166533 states to 166533 states and 190289 transitions. [2019-09-10 03:46:11,703 INFO L78 Accepts]: Start accepts. Automaton has 166533 states and 190289 transitions. Word has length 525 [2019-09-10 03:46:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:11,703 INFO L475 AbstractCegarLoop]: Abstraction has 166533 states and 190289 transitions. [2019-09-10 03:46:11,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-10 03:46:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 166533 states and 190289 transitions. [2019-09-10 03:46:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-10 03:46:11,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:11,858 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,858 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash -531399208, now seen corresponding path program 1 times [2019-09-10 03:46:11,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:11,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-09-10 03:46:12,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:46:12,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:46:12,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 527 with the following transitions: [2019-09-10 03:46:12,118 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [76], [92], [94], [102], [277], [282], [285], [288], [293], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [476], [479], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [673], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [800], [803], [857], [858], [859], [869], [871], [873], [874], [875], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1125], [1128], [1130], [1133], [1144], [1146], [1148], [1152], [1190], [1193], [1194], [1195], [1205], [1207], [1209], [1210], [1211], [1220], [1223], [1226], [1232], [1235], [1241], [1245], [1251], [1254], [1258], [1261], [1267], [1280], [1293], [1306], [1319], [1332], [1345], [1358], [1371], [1375], [1378], [1390], [1400], [1402], [1404], [1405], [1406], [1416], [1418], [1420], [1421], [1422], [1423], [1437], [1439], [1474], [1476], [1479], [1490], [1492], [1494], [1496], [1500], [1501], [1502], [1521], [1522], [1523], [1527], [1528], [1529], [1530], [1531], [1532], [1533], [1534], [1535], [1536], [1537], [1538], [1539], [1540], [1541], [1542], [1543], [1544], [1545], [1546], [1547], [1548], [1549], [1550], [1551], [1552], [1555], [1556], [1557], [1561], [1562], [1563], [1564], [1567], [1568], [1585], [1586], [1587], [1588], [1589], [1590], [1591], [1592], [1593], [1594], [1595], [1596], [1597], [1617], [1618], [1619], [1621], [1622] [2019-09-10 03:46:12,123 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:46:12,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:46:12,268 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:46:12,268 INFO L272 AbstractInterpreter]: Visited 243 different actions 356 times. Never merged. Never widened. Performed 2898 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:46:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:12,269 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:46:12,638 INFO L227 lantSequenceWeakener]: Weakened 370 states. On average, predicates are now at 71.41% of their original sizes. [2019-09-10 03:46:12,638 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:46:33,339 INFO L420 sIntCurrentIteration]: We unified 525 AI predicates to 525 [2019-09-10 03:46:33,340 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:46:33,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:46:33,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [164] imperfect sequences [4] total 166 [2019-09-10 03:46:33,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:33,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-10 03:46:33,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-10 03:46:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2015, Invalid=24717, Unknown=0, NotChecked=0, Total=26732 [2019-09-10 03:46:33,343 INFO L87 Difference]: Start difference. First operand 166533 states and 190289 transitions. Second operand 164 states.