java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.13.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:36:56,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:36:56,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:36:56,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:36:56,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:36:56,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:36:56,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:36:56,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:36:56,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:36:56,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:36:56,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:36:56,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:36:56,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:36:56,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:36:56,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:36:56,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:36:56,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:36:56,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:36:56,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:36:56,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:36:56,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:36:56,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:36:56,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:36:56,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:36:56,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:36:56,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:36:56,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:36:56,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:36:56,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:36:56,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:36:56,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:36:56,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:36:56,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:36:56,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:36:56,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:36:56,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:36:56,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:36:56,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:36:56,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:36:56,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:36:56,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:36:56,227 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:36:56,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:36:56,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:36:56,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:36:56,244 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:36:56,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:36:56,244 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:36:56,245 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:36:56,245 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:36:56,245 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:36:56,245 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:36:56,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:36:56,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:36:56,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:36:56,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:36:56,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:36:56,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:36:56,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:36:56,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:36:56,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:36:56,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:36:56,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:36:56,248 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:36:56,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:36:56,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:36:56,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:36:56,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:36:56,249 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:36:56,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:36:56,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:36:56,250 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:36:56,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:36:56,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:36:56,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:36:56,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:36:56,303 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:36:56,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.13.cil-1.c [2019-09-10 03:36:56,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3c4a82/c255c212253d4b0d8d3356643525a2a1/FLAG167e59dc2 [2019-09-10 03:36:56,939 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:36:56,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.13.cil-1.c [2019-09-10 03:36:56,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3c4a82/c255c212253d4b0d8d3356643525a2a1/FLAG167e59dc2 [2019-09-10 03:36:57,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3c4a82/c255c212253d4b0d8d3356643525a2a1 [2019-09-10 03:36:57,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:36:57,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:36:57,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:36:57,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:36:57,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:36:57,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:36:57" (1/1) ... [2019-09-10 03:36:57,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6813f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:57, skipping insertion in model container [2019-09-10 03:36:57,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:36:57" (1/1) ... [2019-09-10 03:36:57,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:36:57,468 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:36:57,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:36:57,936 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:36:58,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:36:58,094 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:36:58,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58 WrapperNode [2019-09-10 03:36:58,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:36:58,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:36:58,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:36:58,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:36:58,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (1/1) ... [2019-09-10 03:36:58,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:36:58,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:36:58,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:36:58,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:36:58,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (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:36:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:36:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:36:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:36:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:36:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:36:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:36:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:36:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:36:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:36:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:36:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:36:58,302 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:36:58,302 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:36:58,303 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:36:58,303 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:36:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-10 03:36:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-10 03:36:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:36:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:36:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:36:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:36:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:36:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:36:58,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:36:58,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:36:58,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:36:58,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:36:58,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:36:58,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:36:58,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-10 03:36:58,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-10 03:36:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:36:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:36:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:36:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:36:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:36:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:36:58,309 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:36:58,309 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:36:58,309 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:36:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:36:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:36:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:36:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:36:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:36:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:36:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:36:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-10 03:36:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-10 03:36:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:36:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:36:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:36:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:36:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:36:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:36:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:36:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:36:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:36:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:36:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:36:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:36:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:36:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:36:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-10 03:36:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-10 03:36:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:36:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:36:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:36:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:36:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:36:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:36:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:36:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:36:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:36:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:36:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:36:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:36:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:36:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:36:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:36:59,710 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:36:59,710 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-10 03:36:59,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:36:59 BoogieIcfgContainer [2019-09-10 03:36:59,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:36:59,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:36:59,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:36:59,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:36:59,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:36:57" (1/3) ... [2019-09-10 03:36:59,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb95653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:36:59, skipping insertion in model container [2019-09-10 03:36:59,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:36:58" (2/3) ... [2019-09-10 03:36:59,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb95653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:36:59, skipping insertion in model container [2019-09-10 03:36:59,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:36:59" (3/3) ... [2019-09-10 03:36:59,720 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-1.c [2019-09-10 03:36:59,730 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:36:59,740 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:36:59,759 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:36:59,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:36:59,796 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:36:59,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:36:59,797 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:36:59,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:36:59,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:36:59,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:36:59,797 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:36:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states. [2019-09-10 03:36:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:36:59,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:59,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:36:59,863 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 440076770, now seen corresponding path program 1 times [2019-09-10 03:36:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:59,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:00,464 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:00,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:00,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:37:00,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:00,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:37:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:37:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:00,494 INFO L87 Difference]: Start difference. First operand 511 states. Second operand 4 states. [2019-09-10 03:37:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:00,953 INFO L93 Difference]: Finished difference Result 509 states and 747 transitions. [2019-09-10 03:37:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:37:00,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 03:37:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:00,977 INFO L225 Difference]: With dead ends: 509 [2019-09-10 03:37:00,983 INFO L226 Difference]: Without dead ends: 502 [2019-09-10 03:37:00,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-10 03:37:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-09-10 03:37:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 740 transitions. [2019-09-10 03:37:01,116 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 740 transitions. Word has length 246 [2019-09-10 03:37:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:01,119 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 740 transitions. [2019-09-10 03:37:01,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:37:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 740 transitions. [2019-09-10 03:37:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:01,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:01,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:01,127 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:01,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1104069088, now seen corresponding path program 1 times [2019-09-10 03:37:01,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:01,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:01,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:01,353 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,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:01,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:37:01,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:01,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:37:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:37:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:01,358 INFO L87 Difference]: Start difference. First operand 502 states and 740 transitions. Second operand 4 states. [2019-09-10 03:37:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:01,683 INFO L93 Difference]: Finished difference Result 502 states and 739 transitions. [2019-09-10 03:37:01,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:37:01,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 03:37:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:01,690 INFO L225 Difference]: With dead ends: 502 [2019-09-10 03:37:01,690 INFO L226 Difference]: Without dead ends: 502 [2019-09-10 03:37:01,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-10 03:37:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-09-10 03:37:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 739 transitions. [2019-09-10 03:37:01,718 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 739 transitions. Word has length 246 [2019-09-10 03:37:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:01,718 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 739 transitions. [2019-09-10 03:37:01,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:37:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 739 transitions. [2019-09-10 03:37:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:01,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:01,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:01,724 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1428072482, now seen corresponding path program 1 times [2019-09-10 03:37:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:01,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:01,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:01,976 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,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:01,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:01,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:01,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:01,980 INFO L87 Difference]: Start difference. First operand 502 states and 739 transitions. Second operand 5 states. [2019-09-10 03:37:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:03,046 INFO L93 Difference]: Finished difference Result 576 states and 877 transitions. [2019-09-10 03:37:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:03,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:03,050 INFO L225 Difference]: With dead ends: 576 [2019-09-10 03:37:03,051 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 03:37:03,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 03:37:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 502. [2019-09-10 03:37:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 738 transitions. [2019-09-10 03:37:03,071 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 738 transitions. Word has length 246 [2019-09-10 03:37:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:03,072 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 738 transitions. [2019-09-10 03:37:03,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 738 transitions. [2019-09-10 03:37:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:03,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:03,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:03,077 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1182264608, now seen corresponding path program 1 times [2019-09-10 03:37:03,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:03,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:03,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:03,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:37:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:03,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:03,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:03,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:03,248 INFO L87 Difference]: Start difference. First operand 502 states and 738 transitions. Second operand 5 states. [2019-09-10 03:37:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:04,364 INFO L93 Difference]: Finished difference Result 576 states and 877 transitions. [2019-09-10 03:37:04,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:04,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:04,368 INFO L225 Difference]: With dead ends: 576 [2019-09-10 03:37:04,369 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 03:37:04,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 03:37:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 502. [2019-09-10 03:37:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 737 transitions. [2019-09-10 03:37:04,413 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 737 transitions. Word has length 246 [2019-09-10 03:37:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:04,413 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 737 transitions. [2019-09-10 03:37:04,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 737 transitions. [2019-09-10 03:37:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:04,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:04,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:04,423 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1451429986, now seen corresponding path program 1 times [2019-09-10 03:37:04,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:04,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:04,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:04,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:04,572 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:04,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:04,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:04,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:04,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:04,574 INFO L87 Difference]: Start difference. First operand 502 states and 737 transitions. Second operand 5 states. [2019-09-10 03:37:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:05,588 INFO L93 Difference]: Finished difference Result 574 states and 872 transitions. [2019-09-10 03:37:05,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:05,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:05,592 INFO L225 Difference]: With dead ends: 574 [2019-09-10 03:37:05,593 INFO L226 Difference]: Without dead ends: 574 [2019-09-10 03:37:05,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-10 03:37:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 502. [2019-09-10 03:37:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 736 transitions. [2019-09-10 03:37:05,611 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 736 transitions. Word has length 246 [2019-09-10 03:37:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:05,612 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 736 transitions. [2019-09-10 03:37:05,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 736 transitions. [2019-09-10 03:37:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:05,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:05,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:05,617 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1321565408, now seen corresponding path program 1 times [2019-09-10 03:37:05,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:05,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:05,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:05,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:05,740 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:05,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:05,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:05,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:05,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:05,742 INFO L87 Difference]: Start difference. First operand 502 states and 736 transitions. Second operand 5 states. [2019-09-10 03:37:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:06,739 INFO L93 Difference]: Finished difference Result 572 states and 867 transitions. [2019-09-10 03:37:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:06,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:06,745 INFO L225 Difference]: With dead ends: 572 [2019-09-10 03:37:06,746 INFO L226 Difference]: Without dead ends: 572 [2019-09-10 03:37:06,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-10 03:37:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 502. [2019-09-10 03:37:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 735 transitions. [2019-09-10 03:37:06,777 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 735 transitions. Word has length 246 [2019-09-10 03:37:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:06,779 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 735 transitions. [2019-09-10 03:37:06,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 735 transitions. [2019-09-10 03:37:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:06,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:06,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:06,783 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:06,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash 899381086, now seen corresponding path program 1 times [2019-09-10 03:37:06,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:06,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:06,926 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,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:06,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:06,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:06,929 INFO L87 Difference]: Start difference. First operand 502 states and 735 transitions. Second operand 5 states. [2019-09-10 03:37:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:07,974 INFO L93 Difference]: Finished difference Result 570 states and 862 transitions. [2019-09-10 03:37:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:07,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:07,979 INFO L225 Difference]: With dead ends: 570 [2019-09-10 03:37:07,979 INFO L226 Difference]: Without dead ends: 570 [2019-09-10 03:37:07,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-10 03:37:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 502. [2019-09-10 03:37:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 734 transitions. [2019-09-10 03:37:07,998 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 734 transitions. Word has length 246 [2019-09-10 03:37:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:07,999 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 734 transitions. [2019-09-10 03:37:07,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 734 transitions. [2019-09-10 03:37:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:08,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:08,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:08,002 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -414448800, now seen corresponding path program 1 times [2019-09-10 03:37:08,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:08,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:08,166 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:08,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:08,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:08,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:08,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:08,171 INFO L87 Difference]: Start difference. First operand 502 states and 734 transitions. Second operand 5 states. [2019-09-10 03:37:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:09,185 INFO L93 Difference]: Finished difference Result 568 states and 857 transitions. [2019-09-10 03:37:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:09,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:09,190 INFO L225 Difference]: With dead ends: 568 [2019-09-10 03:37:09,190 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 03:37:09,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 03:37:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 502. [2019-09-10 03:37:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 733 transitions. [2019-09-10 03:37:09,207 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 733 transitions. Word has length 246 [2019-09-10 03:37:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:09,208 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 733 transitions. [2019-09-10 03:37:09,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 733 transitions. [2019-09-10 03:37:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:09,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:09,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:09,210 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1288114402, now seen corresponding path program 1 times [2019-09-10 03:37:09,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:09,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:09,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:09,359 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:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:09,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:09,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:09,362 INFO L87 Difference]: Start difference. First operand 502 states and 733 transitions. Second operand 5 states. [2019-09-10 03:37:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:10,460 INFO L93 Difference]: Finished difference Result 564 states and 848 transitions. [2019-09-10 03:37:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:10,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:10,466 INFO L225 Difference]: With dead ends: 564 [2019-09-10 03:37:10,466 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 03:37:10,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 03:37:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 502. [2019-09-10 03:37:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 732 transitions. [2019-09-10 03:37:10,483 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 732 transitions. Word has length 246 [2019-09-10 03:37:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:10,483 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 732 transitions. [2019-09-10 03:37:10,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 732 transitions. [2019-09-10 03:37:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:10,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:10,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:10,486 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2142653860, now seen corresponding path program 1 times [2019-09-10 03:37:10,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:10,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:10,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:10,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:10,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:10,608 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:10,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:10,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:10,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:10,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:10,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:10,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:10,610 INFO L87 Difference]: Start difference. First operand 502 states and 732 transitions. Second operand 5 states. [2019-09-10 03:37:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:11,709 INFO L93 Difference]: Finished difference Result 562 states and 843 transitions. [2019-09-10 03:37:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:11,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:11,714 INFO L225 Difference]: With dead ends: 562 [2019-09-10 03:37:11,714 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 03:37:11,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 03:37:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 502. [2019-09-10 03:37:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 731 transitions. [2019-09-10 03:37:11,731 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 731 transitions. Word has length 246 [2019-09-10 03:37:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:11,732 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 731 transitions. [2019-09-10 03:37:11,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 731 transitions. [2019-09-10 03:37:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:11,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:11,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:11,734 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1016368990, now seen corresponding path program 1 times [2019-09-10 03:37:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:11,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:11,861 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:11,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:11,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:11,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:11,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:11,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:11,864 INFO L87 Difference]: Start difference. First operand 502 states and 731 transitions. Second operand 5 states. [2019-09-10 03:37:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:12,940 INFO L93 Difference]: Finished difference Result 560 states and 838 transitions. [2019-09-10 03:37:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:12,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:12,948 INFO L225 Difference]: With dead ends: 560 [2019-09-10 03:37:12,948 INFO L226 Difference]: Without dead ends: 560 [2019-09-10 03:37:12,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-10 03:37:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 502. [2019-09-10 03:37:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 730 transitions. [2019-09-10 03:37:12,982 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 730 transitions. Word has length 246 [2019-09-10 03:37:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:12,983 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 730 transitions. [2019-09-10 03:37:12,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 730 transitions. [2019-09-10 03:37:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:12,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:12,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:12,994 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:12,994 INFO L82 PathProgramCache]: Analyzing trace with hash 148441628, now seen corresponding path program 1 times [2019-09-10 03:37:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:12,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:12,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:13,185 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:13,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:13,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:13,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:13,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:13,189 INFO L87 Difference]: Start difference. First operand 502 states and 730 transitions. Second operand 5 states. [2019-09-10 03:37:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:14,183 INFO L93 Difference]: Finished difference Result 558 states and 833 transitions. [2019-09-10 03:37:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:14,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:14,189 INFO L225 Difference]: With dead ends: 558 [2019-09-10 03:37:14,190 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 03:37:14,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 03:37:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 502. [2019-09-10 03:37:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 729 transitions. [2019-09-10 03:37:14,213 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 729 transitions. Word has length 246 [2019-09-10 03:37:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:14,214 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 729 transitions. [2019-09-10 03:37:14,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 729 transitions. [2019-09-10 03:37:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:14,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:14,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:14,217 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1126482018, now seen corresponding path program 1 times [2019-09-10 03:37:14,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:14,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:14,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:14,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:14,375 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:14,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:14,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:14,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:14,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:14,378 INFO L87 Difference]: Start difference. First operand 502 states and 729 transitions. Second operand 5 states. [2019-09-10 03:37:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:15,374 INFO L93 Difference]: Finished difference Result 556 states and 828 transitions. [2019-09-10 03:37:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:15,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:15,379 INFO L225 Difference]: With dead ends: 556 [2019-09-10 03:37:15,379 INFO L226 Difference]: Without dead ends: 556 [2019-09-10 03:37:15,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-10 03:37:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 502. [2019-09-10 03:37:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 728 transitions. [2019-09-10 03:37:15,394 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 728 transitions. Word has length 246 [2019-09-10 03:37:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:15,395 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 728 transitions. [2019-09-10 03:37:15,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 728 transitions. [2019-09-10 03:37:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:15,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:15,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:15,397 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1998892580, now seen corresponding path program 1 times [2019-09-10 03:37:15,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:15,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:15,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:15,544 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:15,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:15,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:15,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:15,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:15,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:15,546 INFO L87 Difference]: Start difference. First operand 502 states and 728 transitions. Second operand 5 states. [2019-09-10 03:37:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:16,491 INFO L93 Difference]: Finished difference Result 554 states and 823 transitions. [2019-09-10 03:37:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:16,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:16,495 INFO L225 Difference]: With dead ends: 554 [2019-09-10 03:37:16,496 INFO L226 Difference]: Without dead ends: 554 [2019-09-10 03:37:16,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-10 03:37:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 502. [2019-09-10 03:37:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 727 transitions. [2019-09-10 03:37:16,511 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 727 transitions. Word has length 246 [2019-09-10 03:37:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:16,511 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 727 transitions. [2019-09-10 03:37:16,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 727 transitions. [2019-09-10 03:37:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:16,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:16,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:16,513 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash 328269790, now seen corresponding path program 1 times [2019-09-10 03:37:16,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:16,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:16,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:16,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:16,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:16,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:16,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:16,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:16,621 INFO L87 Difference]: Start difference. First operand 502 states and 727 transitions. Second operand 5 states. [2019-09-10 03:37:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:17,713 INFO L93 Difference]: Finished difference Result 552 states and 818 transitions. [2019-09-10 03:37:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:17,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:17,718 INFO L225 Difference]: With dead ends: 552 [2019-09-10 03:37:17,718 INFO L226 Difference]: Without dead ends: 552 [2019-09-10 03:37:17,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-10 03:37:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 502. [2019-09-10 03:37:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 726 transitions. [2019-09-10 03:37:17,738 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 726 transitions. Word has length 246 [2019-09-10 03:37:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:17,738 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 726 transitions. [2019-09-10 03:37:17,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 726 transitions. [2019-09-10 03:37:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:17,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:17,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:17,740 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 541886876, now seen corresponding path program 1 times [2019-09-10 03:37:17,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:17,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:17,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:17,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:17,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:17,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:17,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:17,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:17,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:17,894 INFO L87 Difference]: Start difference. First operand 502 states and 726 transitions. Second operand 5 states. [2019-09-10 03:37:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:18,868 INFO L93 Difference]: Finished difference Result 596 states and 902 transitions. [2019-09-10 03:37:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:18,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:18,872 INFO L225 Difference]: With dead ends: 596 [2019-09-10 03:37:18,872 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 03:37:18,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 03:37:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 502. [2019-09-10 03:37:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 725 transitions. [2019-09-10 03:37:18,894 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 725 transitions. Word has length 246 [2019-09-10 03:37:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:18,894 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 725 transitions. [2019-09-10 03:37:18,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 725 transitions. [2019-09-10 03:37:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:18,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:18,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:18,897 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1388614950, now seen corresponding path program 1 times [2019-09-10 03:37:18,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:18,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:18,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:18,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:18,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:18,996 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:18,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:18,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:18,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:18,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:18,998 INFO L87 Difference]: Start difference. First operand 502 states and 725 transitions. Second operand 5 states. [2019-09-10 03:37:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:19,983 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-09-10 03:37:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:19,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:19,988 INFO L225 Difference]: With dead ends: 598 [2019-09-10 03:37:19,988 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 03:37:19,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 03:37:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 502. [2019-09-10 03:37:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2019-09-10 03:37:20,002 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 246 [2019-09-10 03:37:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:20,003 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2019-09-10 03:37:20,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2019-09-10 03:37:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:20,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:20,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:20,005 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1181510108, now seen corresponding path program 1 times [2019-09-10 03:37:20,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:20,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:20,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:20,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:20,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:20,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:20,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:20,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:20,116 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand 5 states. [2019-09-10 03:37:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:21,159 INFO L93 Difference]: Finished difference Result 596 states and 897 transitions. [2019-09-10 03:37:21,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:21,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:21,163 INFO L225 Difference]: With dead ends: 596 [2019-09-10 03:37:21,164 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 03:37:21,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 03:37:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 502. [2019-09-10 03:37:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 723 transitions. [2019-09-10 03:37:21,178 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 723 transitions. Word has length 246 [2019-09-10 03:37:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:21,178 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 723 transitions. [2019-09-10 03:37:21,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 723 transitions. [2019-09-10 03:37:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:21,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:21,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:21,181 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash -813792614, now seen corresponding path program 1 times [2019-09-10 03:37:21,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:21,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:21,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:21,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:21,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:21,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:21,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:21,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:21,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:21,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:21,298 INFO L87 Difference]: Start difference. First operand 502 states and 723 transitions. Second operand 5 states. [2019-09-10 03:37:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:22,282 INFO L93 Difference]: Finished difference Result 594 states and 892 transitions. [2019-09-10 03:37:22,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:22,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:22,286 INFO L225 Difference]: With dead ends: 594 [2019-09-10 03:37:22,286 INFO L226 Difference]: Without dead ends: 594 [2019-09-10 03:37:22,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-10 03:37:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 502. [2019-09-10 03:37:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 722 transitions. [2019-09-10 03:37:22,299 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 722 transitions. Word has length 246 [2019-09-10 03:37:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:22,300 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 722 transitions. [2019-09-10 03:37:22,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 722 transitions. [2019-09-10 03:37:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:22,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:22,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:22,302 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1200052764, now seen corresponding path program 1 times [2019-09-10 03:37:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:22,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:22,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:22,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:22,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:22,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:22,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:22,419 INFO L87 Difference]: Start difference. First operand 502 states and 722 transitions. Second operand 5 states. [2019-09-10 03:37:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:23,417 INFO L93 Difference]: Finished difference Result 592 states and 887 transitions. [2019-09-10 03:37:23,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:23,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:23,421 INFO L225 Difference]: With dead ends: 592 [2019-09-10 03:37:23,421 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 03:37:23,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 03:37:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 502. [2019-09-10 03:37:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 721 transitions. [2019-09-10 03:37:23,434 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 721 transitions. Word has length 246 [2019-09-10 03:37:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:23,435 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 721 transitions. [2019-09-10 03:37:23,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 721 transitions. [2019-09-10 03:37:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:23,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:23,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:23,437 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1126468186, now seen corresponding path program 1 times [2019-09-10 03:37:23,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:23,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:23,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:23,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:23,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:23,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:23,545 INFO L87 Difference]: Start difference. First operand 502 states and 721 transitions. Second operand 5 states. [2019-09-10 03:37:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:24,549 INFO L93 Difference]: Finished difference Result 590 states and 882 transitions. [2019-09-10 03:37:24,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:24,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:24,553 INFO L225 Difference]: With dead ends: 590 [2019-09-10 03:37:24,553 INFO L226 Difference]: Without dead ends: 590 [2019-09-10 03:37:24,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-10 03:37:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 502. [2019-09-10 03:37:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 720 transitions. [2019-09-10 03:37:24,565 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 720 transitions. Word has length 246 [2019-09-10 03:37:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:24,566 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 720 transitions. [2019-09-10 03:37:24,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 720 transitions. [2019-09-10 03:37:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:24,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:24,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:24,568 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash -954115492, now seen corresponding path program 1 times [2019-09-10 03:37:24,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:24,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:24,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:24,672 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:24,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:24,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:24,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:24,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:24,673 INFO L87 Difference]: Start difference. First operand 502 states and 720 transitions. Second operand 5 states. [2019-09-10 03:37:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:25,697 INFO L93 Difference]: Finished difference Result 588 states and 877 transitions. [2019-09-10 03:37:25,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:25,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:25,703 INFO L225 Difference]: With dead ends: 588 [2019-09-10 03:37:25,704 INFO L226 Difference]: Without dead ends: 588 [2019-09-10 03:37:25,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-09-10 03:37:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 502. [2019-09-10 03:37:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 719 transitions. [2019-09-10 03:37:25,735 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 719 transitions. Word has length 246 [2019-09-10 03:37:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:25,735 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 719 transitions. [2019-09-10 03:37:25,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 719 transitions. [2019-09-10 03:37:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:25,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:25,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:25,740 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:25,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash -467041766, now seen corresponding path program 1 times [2019-09-10 03:37:25,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:25,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:25,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:25,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:25,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:25,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:25,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:25,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:25,848 INFO L87 Difference]: Start difference. First operand 502 states and 719 transitions. Second operand 5 states. [2019-09-10 03:37:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:26,819 INFO L93 Difference]: Finished difference Result 584 states and 868 transitions. [2019-09-10 03:37:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:26,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:26,822 INFO L225 Difference]: With dead ends: 584 [2019-09-10 03:37:26,823 INFO L226 Difference]: Without dead ends: 584 [2019-09-10 03:37:26,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-10 03:37:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 502. [2019-09-10 03:37:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 718 transitions. [2019-09-10 03:37:26,834 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 718 transitions. Word has length 246 [2019-09-10 03:37:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:26,835 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 718 transitions. [2019-09-10 03:37:26,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 718 transitions. [2019-09-10 03:37:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:26,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:26,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:26,837 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -940277416, now seen corresponding path program 1 times [2019-09-10 03:37:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:26,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:26,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:26,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:26,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:26,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:26,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:26,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:26,941 INFO L87 Difference]: Start difference. First operand 502 states and 718 transitions. Second operand 5 states. [2019-09-10 03:37:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:27,888 INFO L93 Difference]: Finished difference Result 582 states and 863 transitions. [2019-09-10 03:37:27,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:27,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:27,892 INFO L225 Difference]: With dead ends: 582 [2019-09-10 03:37:27,892 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 03:37:27,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 03:37:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 502. [2019-09-10 03:37:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 717 transitions. [2019-09-10 03:37:27,903 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 717 transitions. Word has length 246 [2019-09-10 03:37:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:27,904 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 717 transitions. [2019-09-10 03:37:27,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 717 transitions. [2019-09-10 03:37:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:27,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:27,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:27,906 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -816995750, now seen corresponding path program 1 times [2019-09-10 03:37:27,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:27,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:27,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:28,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:37:28,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:28,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:28,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:28,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:28,003 INFO L87 Difference]: Start difference. First operand 502 states and 717 transitions. Second operand 5 states. [2019-09-10 03:37:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:28,994 INFO L93 Difference]: Finished difference Result 580 states and 858 transitions. [2019-09-10 03:37:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:28,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:28,997 INFO L225 Difference]: With dead ends: 580 [2019-09-10 03:37:28,998 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 03:37:28,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 03:37:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 502. [2019-09-10 03:37:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 716 transitions. [2019-09-10 03:37:29,008 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 716 transitions. Word has length 246 [2019-09-10 03:37:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:29,009 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 716 transitions. [2019-09-10 03:37:29,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 716 transitions. [2019-09-10 03:37:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:29,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:29,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:29,011 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1403738392, now seen corresponding path program 1 times [2019-09-10 03:37:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:29,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:29,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:29,112 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:29,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:29,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:29,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:29,115 INFO L87 Difference]: Start difference. First operand 502 states and 716 transitions. Second operand 5 states. [2019-09-10 03:37:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:30,073 INFO L93 Difference]: Finished difference Result 578 states and 853 transitions. [2019-09-10 03:37:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:30,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:30,078 INFO L225 Difference]: With dead ends: 578 [2019-09-10 03:37:30,078 INFO L226 Difference]: Without dead ends: 578 [2019-09-10 03:37:30,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-10 03:37:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 502. [2019-09-10 03:37:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 715 transitions. [2019-09-10 03:37:30,088 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 715 transitions. Word has length 246 [2019-09-10 03:37:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:30,089 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 715 transitions. [2019-09-10 03:37:30,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 715 transitions. [2019-09-10 03:37:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:30,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:30,091 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:30,091 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1988308326, now seen corresponding path program 1 times [2019-09-10 03:37:30,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:30,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:30,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:30,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:30,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:30,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:30,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:30,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:30,196 INFO L87 Difference]: Start difference. First operand 502 states and 715 transitions. Second operand 5 states. [2019-09-10 03:37:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:31,201 INFO L93 Difference]: Finished difference Result 576 states and 848 transitions. [2019-09-10 03:37:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:31,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:37:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:31,205 INFO L225 Difference]: With dead ends: 576 [2019-09-10 03:37:31,205 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 03:37:31,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:37:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 03:37:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 502. [2019-09-10 03:37:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 03:37:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 714 transitions. [2019-09-10 03:37:31,218 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 714 transitions. Word has length 246 [2019-09-10 03:37:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:31,218 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 714 transitions. [2019-09-10 03:37:31,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 714 transitions. [2019-09-10 03:37:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:37:31,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:31,220 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2058690776, now seen corresponding path program 1 times [2019-09-10 03:37:31,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:31,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:31,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:31,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:31,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:37:31,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:31,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:37:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:37:31,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:31,340 INFO L87 Difference]: Start difference. First operand 502 states and 714 transitions. Second operand 4 states. [2019-09-10 03:37:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:31,779 INFO L93 Difference]: Finished difference Result 958 states and 1357 transitions. [2019-09-10 03:37:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:37:31,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 03:37:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:31,786 INFO L225 Difference]: With dead ends: 958 [2019-09-10 03:37:31,786 INFO L226 Difference]: Without dead ends: 958 [2019-09-10 03:37:31,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-09-10 03:37:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 957. [2019-09-10 03:37:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-09-10 03:37:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1356 transitions. [2019-09-10 03:37:31,810 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1356 transitions. Word has length 246 [2019-09-10 03:37:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:31,810 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1356 transitions. [2019-09-10 03:37:31,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:37:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1356 transitions. [2019-09-10 03:37:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:37:31,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:31,815 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:31,815 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:31,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1924086306, now seen corresponding path program 1 times [2019-09-10 03:37:31,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:31,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:31,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:31,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-10 03:37:31,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:37:31,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:37:31,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:37:31,980 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [963], [964], [965], [968], [971], [979], [980], [983], [989], [995], [1001], [1009], [1013], [1019], [1025], [1031], [1037], [1043], [1049], [1057], [1061], [1067], [1073], [1079], [1085], [1091], [1097], [1105], [1109], [1115], [1121], [1127], [1133], [1139], [1145], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1249], [1250], [1251], [1254], [1257], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:37:32,044 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:37:32,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:37:32,286 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:37:32,288 INFO L272 AbstractInterpreter]: Visited 74 different actions 74 times. Never merged. Never widened. Performed 797 root evaluator evaluations with a maximum evaluation depth of 3. Performed 797 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:37:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:32,295 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:37:32,772 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 67.51% of their original sizes. [2019-09-10 03:37:32,772 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:37:33,389 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:37:33,389 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:37:33,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:37:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2019-09-10 03:37:33,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:33,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 03:37:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 03:37:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:37:33,393 INFO L87 Difference]: Start difference. First operand 957 states and 1356 transitions. Second operand 21 states. [2019-09-10 03:37:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:45,450 INFO L93 Difference]: Finished difference Result 1282 states and 1746 transitions. [2019-09-10 03:37:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:37:45,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 411 [2019-09-10 03:37:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:45,455 INFO L225 Difference]: With dead ends: 1282 [2019-09-10 03:37:45,456 INFO L226 Difference]: Without dead ends: 1282 [2019-09-10 03:37:45,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:37:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-09-10 03:37:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1252. [2019-09-10 03:37:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-09-10 03:37:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1715 transitions. [2019-09-10 03:37:45,482 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1715 transitions. Word has length 411 [2019-09-10 03:37:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:45,482 INFO L475 AbstractCegarLoop]: Abstraction has 1252 states and 1715 transitions. [2019-09-10 03:37:45,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 03:37:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1715 transitions. [2019-09-10 03:37:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-09-10 03:37:45,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:45,488 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:45,488 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:45,489 INFO L82 PathProgramCache]: Analyzing trace with hash 156424359, now seen corresponding path program 1 times [2019-09-10 03:37:45,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:45,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:45,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:45,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-10 03:37:45,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:37:45,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:37:45,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 442 with the following transitions: [2019-09-10 03:37:45,711 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [47], [63], [65], [73], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1383], [1396], [1409], [1413], [1416], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1799], [1800], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:37:45,721 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:37:45,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:37:45,781 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:37:45,781 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Performed 877 root evaluator evaluations with a maximum evaluation depth of 4. Performed 877 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:37:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:45,782 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:37:45,937 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 67.3% of their original sizes. [2019-09-10 03:37:45,937 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:37:46,710 INFO L420 sIntCurrentIteration]: We unified 440 AI predicates to 440 [2019-09-10 03:37:46,711 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:37:46,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:37:46,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2019-09-10 03:37:46,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:46,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:37:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:37:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:37:46,713 INFO L87 Difference]: Start difference. First operand 1252 states and 1715 transitions. Second operand 26 states. [2019-09-10 03:38:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:00,605 INFO L93 Difference]: Finished difference Result 1269 states and 1717 transitions. [2019-09-10 03:38:00,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:38:00,605 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 441 [2019-09-10 03:38:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:00,611 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:38:00,612 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:38:00,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=833, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:38:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:38:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:38:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:38:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1686 transitions. [2019-09-10 03:38:00,637 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1686 transitions. Word has length 441 [2019-09-10 03:38:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:00,638 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1686 transitions. [2019-09-10 03:38:00,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:38:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1686 transitions. [2019-09-10 03:38:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:38:00,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:00,643 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:00,644 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash -757672546, now seen corresponding path program 1 times [2019-09-10 03:38:00,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-10 03:38:00,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:00,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:00,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:38:00,821 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [47], [63], [65], [73], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1396], [1409], [1413], [1416], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1799], [1800], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:38:00,824 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:00,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:00,895 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:00,896 INFO L272 AbstractInterpreter]: Visited 95 different actions 95 times. Never merged. Never widened. Performed 956 root evaluator evaluations with a maximum evaluation depth of 4. Performed 956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:38:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:00,897 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:01,059 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 67% of their original sizes. [2019-09-10 03:38:01,059 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:02,059 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:38:02,059 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:02,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:02,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2019-09-10 03:38:02,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:02,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 03:38:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 03:38:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:38:02,061 INFO L87 Difference]: Start difference. First operand 1239 states and 1686 transitions. Second operand 30 states. [2019-09-10 03:38:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:16,223 INFO L93 Difference]: Finished difference Result 1269 states and 1715 transitions. [2019-09-10 03:38:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:38:16,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 442 [2019-09-10 03:38:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:16,229 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:38:16,229 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:38:16,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:38:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:38:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:38:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:38:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1684 transitions. [2019-09-10 03:38:16,254 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1684 transitions. Word has length 442 [2019-09-10 03:38:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:16,255 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1684 transitions. [2019-09-10 03:38:16,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 03:38:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1684 transitions. [2019-09-10 03:38:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:38:16,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:16,260 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:16,260 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2048177802, now seen corresponding path program 1 times [2019-09-10 03:38:16,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:16,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:16,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:38:16,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:16,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:16,482 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:38:16,483 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:38:16,488 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:16,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:16,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:16,603 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Performed 1035 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1035 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:38:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:16,604 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:16,774 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 67.8% of their original sizes. [2019-09-10 03:38:16,774 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:17,941 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:38:17,941 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:17,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:17,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [6] total 38 [2019-09-10 03:38:17,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:17,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:38:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:38:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:38:17,943 INFO L87 Difference]: Start difference. First operand 1239 states and 1684 transitions. Second operand 34 states. [2019-09-10 03:38:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:37,365 INFO L93 Difference]: Finished difference Result 1269 states and 1714 transitions. [2019-09-10 03:38:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:38:37,365 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 411 [2019-09-10 03:38:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:37,371 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:38:37,372 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:38:37,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=573, Invalid=1977, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 03:38:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:38:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:38:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:38:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1683 transitions. [2019-09-10 03:38:37,397 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1683 transitions. Word has length 411 [2019-09-10 03:38:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:37,398 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1683 transitions. [2019-09-10 03:38:37,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:38:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1683 transitions. [2019-09-10 03:38:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:38:37,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:37,403 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:37,404 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash -806947266, now seen corresponding path program 1 times [2019-09-10 03:38:37,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:37,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:37,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:38:37,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:37,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:37,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:38:37,598 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:38:37,601 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:37,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:37,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:37,690 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Performed 1114 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1114 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:38:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:37,690 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:37,929 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 66.26% of their original sizes. [2019-09-10 03:38:37,929 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:39,587 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:38:39,588 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:39,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:39,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [6] total 42 [2019-09-10 03:38:39,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:39,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:38:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:38:39,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:38:39,591 INFO L87 Difference]: Start difference. First operand 1239 states and 1683 transitions. Second operand 38 states. [2019-09-10 03:39:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:11,841 INFO L93 Difference]: Finished difference Result 1269 states and 1711 transitions. [2019-09-10 03:39:11,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:39:11,841 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 442 [2019-09-10 03:39:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:11,846 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:39:11,846 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:39:11,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:39:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:39:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:39:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:39:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1680 transitions. [2019-09-10 03:39:11,871 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1680 transitions. Word has length 442 [2019-09-10 03:39:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:11,871 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1680 transitions. [2019-09-10 03:39:11,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:39:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1680 transitions. [2019-09-10 03:39:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:39:11,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:11,877 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:39:11,877 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1998605504, now seen corresponding path program 1 times [2019-09-10 03:39:11,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:11,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:11,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-10 03:39:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:12,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:12,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:39:12,089 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:39:12,092 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:12,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:12,188 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:12,188 INFO L272 AbstractInterpreter]: Visited 125 different actions 125 times. Never merged. Never widened. Performed 1193 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:39:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:12,189 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:12,403 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 65.83% of their original sizes. [2019-09-10 03:39:12,403 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:14,624 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:39:14,624 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:14,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:14,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [6] total 46 [2019-09-10 03:39:14,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:14,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 03:39:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 03:39:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 03:39:14,627 INFO L87 Difference]: Start difference. First operand 1239 states and 1680 transitions. Second operand 42 states. [2019-09-10 03:40:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:03,668 INFO L93 Difference]: Finished difference Result 1269 states and 1709 transitions. [2019-09-10 03:40:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:40:03,668 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 442 [2019-09-10 03:40:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:03,673 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:40:03,674 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:40:03,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=891, Invalid=4079, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 03:40:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:40:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:40:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:40:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1678 transitions. [2019-09-10 03:40:03,697 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1678 transitions. Word has length 442 [2019-09-10 03:40:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:03,698 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1678 transitions. [2019-09-10 03:40:03,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 03:40:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1678 transitions. [2019-09-10 03:40:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:40:03,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:03,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,703 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -592021960, now seen corresponding path program 1 times [2019-09-10 03:40:03,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:03,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:03,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:40:03,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:03,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:03,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:40:03,860 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:40:03,863 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:03,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:03,943 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:03,943 INFO L272 AbstractInterpreter]: Visited 136 different actions 136 times. Never merged. Never widened. Performed 1273 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:40:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:03,944 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:04,119 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 68.33% of their original sizes. [2019-09-10 03:40:04,119 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:06,631 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:40:06,631 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:06,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:06,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [6] total 50 [2019-09-10 03:40:06,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:06,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 03:40:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 03:40:06,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1819, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 03:40:06,633 INFO L87 Difference]: Start difference. First operand 1239 states and 1678 transitions. Second operand 46 states. [2019-09-10 03:41:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:41:01,942 INFO L93 Difference]: Finished difference Result 1269 states and 1708 transitions. [2019-09-10 03:41:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:41:01,942 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 411 [2019-09-10 03:41:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:41:01,947 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:41:01,948 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:41:01,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=927, Invalid=4623, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 03:41:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:41:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:41:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:41:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1677 transitions. [2019-09-10 03:41:01,972 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1677 transitions. Word has length 411 [2019-09-10 03:41:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:41:01,974 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1677 transitions. [2019-09-10 03:41:01,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 03:41:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1677 transitions. [2019-09-10 03:41:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:41:01,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:41:01,980 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:41:01,980 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:41:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash -329300608, now seen corresponding path program 1 times [2019-09-10 03:41:01,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:41:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:01,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:41:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:01,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:41:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:41:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 03:41:02,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:41:02,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:41:02,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:41:02,158 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:41:02,163 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:41:02,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:41:02,235 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:41:02,236 INFO L272 AbstractInterpreter]: Visited 147 different actions 147 times. Never merged. Never widened. Performed 1353 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1353 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:41:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:02,236 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:41:02,419 INFO L227 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 64.9% of their original sizes. [2019-09-10 03:41:02,419 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:41:05,509 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:41:05,509 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:41:05,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:41:05,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [6] total 54 [2019-09-10 03:41:05,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:41:05,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 03:41:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 03:41:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 03:41:05,511 INFO L87 Difference]: Start difference. First operand 1239 states and 1677 transitions. Second operand 50 states. [2019-09-10 03:41:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:41:45,855 INFO L93 Difference]: Finished difference Result 1269 states and 1705 transitions. [2019-09-10 03:41:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 03:41:45,855 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 442 [2019-09-10 03:41:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:41:45,859 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:41:45,859 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:41:45,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1248, Invalid=6584, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:41:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:41:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:41:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:41:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1674 transitions. [2019-09-10 03:41:45,884 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1674 transitions. Word has length 442 [2019-09-10 03:41:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:41:45,884 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1674 transitions. [2019-09-10 03:41:45,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 03:41:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1674 transitions. [2019-09-10 03:41:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:41:45,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:41:45,889 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:41:45,890 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:41:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash 481219006, now seen corresponding path program 1 times [2019-09-10 03:41:45,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:41:45,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:41:45,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:45,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:41:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:41:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-10 03:41:46,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:41:46,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:41:46,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:41:46,355 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:41:46,360 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:41:46,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:41:46,512 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:41:46,512 INFO L272 AbstractInterpreter]: Visited 158 different actions 158 times. Never merged. Never widened. Performed 1433 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1433 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:41:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:46,513 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:41:46,882 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 64.41% of their original sizes. [2019-09-10 03:41:46,882 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:41:50,747 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:41:50,747 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:41:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:41:50,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2019-09-10 03:41:50,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:41:50,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 03:41:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 03:41:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2649, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 03:41:50,750 INFO L87 Difference]: Start difference. First operand 1239 states and 1674 transitions. Second operand 54 states. [2019-09-10 03:42:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:38,516 INFO L93 Difference]: Finished difference Result 1269 states and 1703 transitions. [2019-09-10 03:42:38,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 03:42:38,516 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 442 [2019-09-10 03:42:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:38,520 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:42:38,520 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:42:38,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1449, Invalid=8057, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 03:42:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:42:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:42:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:42:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1672 transitions. [2019-09-10 03:42:38,543 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1672 transitions. Word has length 442 [2019-09-10 03:42:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:38,544 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1672 transitions. [2019-09-10 03:42:38,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 03:42:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1672 transitions. [2019-09-10 03:42:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:42:38,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:38,549 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:42:38,549 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:38,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1344989120, now seen corresponding path program 1 times [2019-09-10 03:42:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:38,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-10 03:42:38,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:38,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:38,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:42:38,692 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:42:38,695 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:38,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:38,770 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:38,770 INFO L272 AbstractInterpreter]: Visited 168 different actions 168 times. Never merged. Never widened. Performed 1512 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1512 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:42:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:38,771 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:38,973 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 63.9% of their original sizes. [2019-09-10 03:42:38,973 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:43,489 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:42:43,490 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:43,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [6] total 62 [2019-09-10 03:42:43,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:43,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:42:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:42:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3083, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:42:43,492 INFO L87 Difference]: Start difference. First operand 1239 states and 1672 transitions. Second operand 58 states. [2019-09-10 03:43:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:43:50,299 INFO L93 Difference]: Finished difference Result 1269 states and 1701 transitions. [2019-09-10 03:43:50,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 03:43:50,299 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 442 [2019-09-10 03:43:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:43:50,302 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:43:50,302 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:43:50,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1665, Invalid=9677, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 03:43:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:43:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:43:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:43:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1670 transitions. [2019-09-10 03:43:50,324 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1670 transitions. Word has length 442 [2019-09-10 03:43:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:43:50,324 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1670 transitions. [2019-09-10 03:43:50,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:43:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1670 transitions. [2019-09-10 03:43:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:43:50,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:43:50,330 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:43:50,330 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:43:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash -491771208, now seen corresponding path program 1 times [2019-09-10 03:43:50,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:43:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:50,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:43:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:50,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:43:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:43:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-10 03:43:50,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:43:50,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:43:50,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:43:50,564 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:43:50,568 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:43:50,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:43:50,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:43:50,686 INFO L272 AbstractInterpreter]: Visited 178 different actions 178 times. Never merged. Never widened. Performed 1591 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1591 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:43:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:50,687 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:43:50,941 INFO L227 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 68.81% of their original sizes. [2019-09-10 03:43:50,941 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:43:55,035 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:43:55,035 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:43:55,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:43:55,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [6] total 66 [2019-09-10 03:43:55,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:43:55,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 03:43:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 03:43:55,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3467, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:43:55,037 INFO L87 Difference]: Start difference. First operand 1239 states and 1670 transitions. Second operand 62 states. [2019-09-10 03:44:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:44:51,481 INFO L93 Difference]: Finished difference Result 1269 states and 1700 transitions. [2019-09-10 03:44:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 03:44:51,481 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 411 [2019-09-10 03:44:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:44:51,484 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:44:51,484 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:44:51,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1455, Invalid=9887, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 03:44:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:44:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:44:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:44:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1669 transitions. [2019-09-10 03:44:51,502 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1669 transitions. Word has length 411 [2019-09-10 03:44:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:44:51,503 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1669 transitions. [2019-09-10 03:44:51,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 03:44:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1669 transitions. [2019-09-10 03:44:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:44:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:44:51,508 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:44:51,508 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:44:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash 975608320, now seen corresponding path program 1 times [2019-09-10 03:44:51,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:44:51,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:51,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:44:51,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:51,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:44:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:44:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-10 03:44:51,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:44:51,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:44:51,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:44:51,671 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:44:51,673 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:44:51,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:44:51,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:44:51,745 INFO L272 AbstractInterpreter]: Visited 189 different actions 189 times. Never merged. Never widened. Performed 1671 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1671 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:44:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:51,746 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:44:51,950 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 62.87% of their original sizes. [2019-09-10 03:44:51,950 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:44:58,083 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:44:58,083 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:44:58,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:44:58,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [6] total 70 [2019-09-10 03:44:58,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:44:58,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 03:44:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 03:44:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4044, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:44:58,085 INFO L87 Difference]: Start difference. First operand 1239 states and 1669 transitions. Second operand 66 states. [2019-09-10 03:46:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:01,828 INFO L93 Difference]: Finished difference Result 1269 states and 1697 transitions. [2019-09-10 03:46:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 03:46:01,829 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 442 [2019-09-10 03:46:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:01,832 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:46:01,832 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:46:01,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2578 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2142, Invalid=13358, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 03:46:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:46:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:46:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:46:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1666 transitions. [2019-09-10 03:46:01,851 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1666 transitions. Word has length 442 [2019-09-10 03:46:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:01,852 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1666 transitions. [2019-09-10 03:46:01,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 03:46:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1666 transitions. [2019-09-10 03:46:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:46:01,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:01,857 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:46:01,857 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 872312126, now seen corresponding path program 1 times [2019-09-10 03:46:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:01,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-10 03:46:02,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:46:02,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:46:02,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:46:02,004 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:46:02,008 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:46:02,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:46:02,130 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:46:02,130 INFO L272 AbstractInterpreter]: Visited 200 different actions 200 times. Never merged. Never widened. Performed 1751 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:46:02,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:02,130 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:46:02,452 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 62.33% of their original sizes. [2019-09-10 03:46:02,453 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:46:09,629 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:46:09,629 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:46:09,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:46:09,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [6] total 74 [2019-09-10 03:46:09,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:09,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 03:46:09,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 03:46:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4571, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 03:46:09,631 INFO L87 Difference]: Start difference. First operand 1239 states and 1666 transitions. Second operand 70 states. [2019-09-10 03:47:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:46,390 INFO L93 Difference]: Finished difference Result 1269 states and 1695 transitions. [2019-09-10 03:47:46,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 03:47:46,391 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 442 [2019-09-10 03:47:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:46,395 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:47:46,395 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:47:46,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2988 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2403, Invalid=15419, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 03:47:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:47:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:47:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:47:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1664 transitions. [2019-09-10 03:47:46,414 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1664 transitions. Word has length 442 [2019-09-10 03:47:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:46,415 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1664 transitions. [2019-09-10 03:47:46,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 03:47:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1664 transitions. [2019-09-10 03:47:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:47:46,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:46,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,420 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1590272960, now seen corresponding path program 1 times [2019-09-10 03:47:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-10 03:47:46,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:47:46,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:47:46,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:47:46,635 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [835], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1380], [1387], [1390], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1795], [1796], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:47:46,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:47:46,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:47:46,734 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:47:46,734 INFO L272 AbstractInterpreter]: Visited 210 different actions 210 times. Never merged. Never widened. Performed 1830 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1830 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:47:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:46,735 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:47:46,976 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 61.8% of their original sizes. [2019-09-10 03:47:46,976 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:47:55,141 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:47:55,142 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:47:55,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:47:55,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [6] total 78 [2019-09-10 03:47:55,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:55,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 03:47:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 03:47:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=5129, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:47:55,144 INFO L87 Difference]: Start difference. First operand 1239 states and 1664 transitions. Second operand 74 states. [2019-09-10 03:49:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:11,424 INFO L93 Difference]: Finished difference Result 1269 states and 1693 transitions. [2019-09-10 03:49:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 03:49:11,425 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 442 [2019-09-10 03:49:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:11,428 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 03:49:11,428 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 03:49:11,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3428 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=2679, Invalid=17627, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 03:49:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 03:49:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2019-09-10 03:49:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-09-10 03:49:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1662 transitions. [2019-09-10 03:49:11,450 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1662 transitions. Word has length 442 [2019-09-10 03:49:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:11,451 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1662 transitions. [2019-09-10 03:49:11,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 03:49:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1662 transitions. [2019-09-10 03:49:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:49:11,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:11,457 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:49:11,457 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1862327554, now seen corresponding path program 1 times [2019-09-10 03:49:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:11,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:11,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:49:11,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:11,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:11,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:11,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:11,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:11,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:11,912 INFO L87 Difference]: Start difference. First operand 1239 states and 1662 transitions. Second operand 6 states. [2019-09-10 03:49:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:11,957 INFO L93 Difference]: Finished difference Result 1285 states and 1735 transitions. [2019-09-10 03:49:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:11,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 442 [2019-09-10 03:49:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:11,963 INFO L225 Difference]: With dead ends: 1285 [2019-09-10 03:49:11,963 INFO L226 Difference]: Without dead ends: 1285 [2019-09-10 03:49:11,963 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:49:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-09-10 03:49:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1244. [2019-09-10 03:49:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-09-10 03:49:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1666 transitions. [2019-09-10 03:49:11,983 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1666 transitions. Word has length 442 [2019-09-10 03:49:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:11,984 INFO L475 AbstractCegarLoop]: Abstraction has 1244 states and 1666 transitions. [2019-09-10 03:49:11,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1666 transitions. [2019-09-10 03:49:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:49:11,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:11,989 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,989 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash -881372740, now seen corresponding path program 1 times [2019-09-10 03:49:11,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:11,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:11,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 03:49:12,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:12,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:12,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:12,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:12,206 INFO L87 Difference]: Start difference. First operand 1244 states and 1666 transitions. Second operand 6 states. [2019-09-10 03:49:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:12,242 INFO L93 Difference]: Finished difference Result 1324 states and 1794 transitions. [2019-09-10 03:49:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:12,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 442 [2019-09-10 03:49:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:12,247 INFO L225 Difference]: With dead ends: 1324 [2019-09-10 03:49:12,247 INFO L226 Difference]: Without dead ends: 1324 [2019-09-10 03:49:12,248 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:49:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2019-09-10 03:49:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1254. [2019-09-10 03:49:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-09-10 03:49:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1676 transitions. [2019-09-10 03:49:12,268 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1676 transitions. Word has length 442 [2019-09-10 03:49:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:12,269 INFO L475 AbstractCegarLoop]: Abstraction has 1254 states and 1676 transitions. [2019-09-10 03:49:12,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1676 transitions. [2019-09-10 03:49:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:49:12,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:12,274 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:49:12,274 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1277711354, now seen corresponding path program 1 times [2019-09-10 03:49:12,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:49:12,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:12,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:12,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:12,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:12,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:12,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:12,440 INFO L87 Difference]: Start difference. First operand 1254 states and 1676 transitions. Second operand 6 states. [2019-09-10 03:49:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:12,471 INFO L93 Difference]: Finished difference Result 1328 states and 1794 transitions. [2019-09-10 03:49:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:12,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 442 [2019-09-10 03:49:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:12,476 INFO L225 Difference]: With dead ends: 1328 [2019-09-10 03:49:12,476 INFO L226 Difference]: Without dead ends: 1328 [2019-09-10 03:49:12,477 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:49:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-09-10 03:49:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1264. [2019-09-10 03:49:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2019-09-10 03:49:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1686 transitions. [2019-09-10 03:49:12,498 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1686 transitions. Word has length 442 [2019-09-10 03:49:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:12,499 INFO L475 AbstractCegarLoop]: Abstraction has 1264 states and 1686 transitions. [2019-09-10 03:49:12,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1686 transitions. [2019-09-10 03:49:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:49:12,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:12,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:49:12,504 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash -363777994, now seen corresponding path program 1 times [2019-09-10 03:49:12,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:12,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-10 03:49:12,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:49:12,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:49:12,719 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:49:12,720 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [739], [742], [745], [747], [750], [755], [758], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [835], [838], [841], [843], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1332], [1335], [1336], [1337], [1347], [1349], [1351], [1352], [1353], [1362], [1365], [1368], [1374], [1377], [1396], [1409], [1422], [1435], [1448], [1461], [1474], [1487], [1500], [1513], [1526], [1539], [1552], [1558], [1568], [1570], [1572], [1573], [1574], [1584], [1586], [1588], [1589], [1590], [1591], [1605], [1607], [1727], [1728], [1747], [1748], [1749], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1772], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1791], [1792], [1793], [1794], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1829], [1830], [1831], [1851], [1852], [1853] [2019-09-10 03:49:12,722 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:49:12,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:49:12,951 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:49:12,952 INFO L272 AbstractInterpreter]: Visited 271 different actions 416 times. Never merged. Never widened. Performed 3498 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:49:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:12,952 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:49:13,423 INFO L227 lantSequenceWeakener]: Weakened 387 states. On average, predicates are now at 77.13% of their original sizes. [2019-09-10 03:49:13,423 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:49:35,055 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:49:35,055 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:49:35,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:49:35,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [187] imperfect sequences [4] total 189 [2019-09-10 03:49:35,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:35,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 187 states [2019-09-10 03:49:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2019-09-10 03:49:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2520, Invalid=32262, Unknown=0, NotChecked=0, Total=34782 [2019-09-10 03:49:35,060 INFO L87 Difference]: Start difference. First operand 1264 states and 1686 transitions. Second operand 187 states.