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.14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:38:18,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:38:18,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:38:18,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:38:18,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:38:18,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:38:19,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:38:19,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:38:19,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:38:19,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:38:19,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:38:19,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:38:19,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:38:19,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:38:19,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:38:19,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:38:19,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:38:19,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:38:19,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:38:19,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:38:19,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:38:19,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:38:19,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:38:19,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:38:19,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:38:19,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:38:19,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:38:19,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:38:19,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:38:19,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:38:19,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:38:19,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:38:19,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:38:19,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:38:19,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:38:19,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:38:19,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:38:19,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:38:19,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:38:19,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:38:19,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:38:19,065 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:38:19,092 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:38:19,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:38:19,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:38:19,094 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:38:19,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:38:19,095 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:38:19,095 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:38:19,095 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:38:19,095 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:38:19,096 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:38:19,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:38:19,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:38:19,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:38:19,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:38:19,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:38:19,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:38:19,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:38:19,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:38:19,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:38:19,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:38:19,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:38:19,100 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:38:19,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:38:19,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:38:19,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:38:19,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:38:19,101 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:38:19,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:38:19,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:38:19,101 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:38:19,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:38:19,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:38:19,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:38:19,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:38:19,178 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:38:19,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.14.cil.c [2019-09-10 03:38:19,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de2c493/3878d7cdc82e48b694d7b6354853194a/FLAG3adcc48e7 [2019-09-10 03:38:19,744 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:38:19,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.14.cil.c [2019-09-10 03:38:19,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de2c493/3878d7cdc82e48b694d7b6354853194a/FLAG3adcc48e7 [2019-09-10 03:38:20,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de2c493/3878d7cdc82e48b694d7b6354853194a [2019-09-10 03:38:20,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:38:20,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:38:20,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:38:20,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:38:20,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:38:20,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328a7f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20, skipping insertion in model container [2019-09-10 03:38:20,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,088 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:38:20,156 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:38:20,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:38:20,584 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:38:20,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:38:20,734 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:38:20,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20 WrapperNode [2019-09-10 03:38:20,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:38:20,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:38:20,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:38:20,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:38:20,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (1/1) ... [2019-09-10 03:38:20,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:38:20,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:38:20,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:38:20,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:38:20,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (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:38:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:38:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:38:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:38:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:38:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:38:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:38:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:38:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:38:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:38:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:38:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:38:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:38:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:38:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:38:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:38:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-10 03:38:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:38:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:38:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:38:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:38:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:38:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:38:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:38:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:38:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:38:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:38:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:38:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:38:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-10 03:38:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:38:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:38:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:38:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:38:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:38:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:38:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:38:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:38:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:38:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:38:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:38:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:38:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:38:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:38:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:38:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:38:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:38:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:38:20,932 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:38:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:38:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:38:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:38:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:38:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:38:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:38:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:38:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:38:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:38:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:38:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:38:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:38:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-10 03:38:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:38:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:38:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:38:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:38:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:38:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:38:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:38:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:38:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:38:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:38:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:38:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:38:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:38:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:38:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:38:22,267 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:38:22,268 INFO L283 CfgBuilder]: Removed 15 assume(true) statements. [2019-09-10 03:38:22,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:38:22 BoogieIcfgContainer [2019-09-10 03:38:22,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:38:22,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:38:22,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:38:22,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:38:22,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:38:20" (1/3) ... [2019-09-10 03:38:22,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfed067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:38:22, skipping insertion in model container [2019-09-10 03:38:22,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:20" (2/3) ... [2019-09-10 03:38:22,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfed067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:38:22, skipping insertion in model container [2019-09-10 03:38:22,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:38:22" (3/3) ... [2019-09-10 03:38:22,279 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.14.cil.c [2019-09-10 03:38:22,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:38:22,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:38:22,329 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:38:22,363 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:38:22,363 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:38:22,363 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:38:22,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:38:22,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:38:22,364 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:38:22,364 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:38:22,364 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:38:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states. [2019-09-10 03:38:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:22,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:22,425 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] [2019-09-10 03:38:22,426 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1216430982, now seen corresponding path program 1 times [2019-09-10 03:38:22,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:22,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:22,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:22,937 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:38:22,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:22,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:22,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:22,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:22,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:22,968 INFO L87 Difference]: Start difference. First operand 479 states. Second operand 4 states. [2019-09-10 03:38:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:23,381 INFO L93 Difference]: Finished difference Result 477 states and 697 transitions. [2019-09-10 03:38:23,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:23,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 03:38:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:23,403 INFO L225 Difference]: With dead ends: 477 [2019-09-10 03:38:23,404 INFO L226 Difference]: Without dead ends: 470 [2019-09-10 03:38:23,405 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:38:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-10 03:38:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-09-10 03:38:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 690 transitions. [2019-09-10 03:38:23,493 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 690 transitions. Word has length 232 [2019-09-10 03:38:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:23,495 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 690 transitions. [2019-09-10 03:38:23,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 690 transitions. [2019-09-10 03:38:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:23,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:23,503 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] [2019-09-10 03:38:23,503 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:23,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1273296328, now seen corresponding path program 1 times [2019-09-10 03:38:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:23,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:23,738 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:38:23,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:23,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:23,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:23,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:23,743 INFO L87 Difference]: Start difference. First operand 470 states and 690 transitions. Second operand 4 states. [2019-09-10 03:38:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:24,057 INFO L93 Difference]: Finished difference Result 470 states and 689 transitions. [2019-09-10 03:38:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:24,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 03:38:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:24,062 INFO L225 Difference]: With dead ends: 470 [2019-09-10 03:38:24,062 INFO L226 Difference]: Without dead ends: 470 [2019-09-10 03:38:24,063 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:38:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-10 03:38:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-09-10 03:38:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 689 transitions. [2019-09-10 03:38:24,096 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 689 transitions. Word has length 232 [2019-09-10 03:38:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:24,097 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 689 transitions. [2019-09-10 03:38:24,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 689 transitions. [2019-09-10 03:38:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:24,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:24,104 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] [2019-09-10 03:38:24,104 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2146961930, now seen corresponding path program 1 times [2019-09-10 03:38:24,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:24,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:24,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:24,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:24,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:24,326 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:38:24,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:24,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:24,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:24,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:24,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:24,329 INFO L87 Difference]: Start difference. First operand 470 states and 689 transitions. Second operand 5 states. [2019-09-10 03:38:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:25,305 INFO L93 Difference]: Finished difference Result 540 states and 819 transitions. [2019-09-10 03:38:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:25,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:25,311 INFO L225 Difference]: With dead ends: 540 [2019-09-10 03:38:25,311 INFO L226 Difference]: Without dead ends: 540 [2019-09-10 03:38:25,312 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:38:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-10 03:38:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 470. [2019-09-10 03:38:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 688 transitions. [2019-09-10 03:38:25,345 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 688 transitions. Word has length 232 [2019-09-10 03:38:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:25,345 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 688 transitions. [2019-09-10 03:38:25,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 688 transitions. [2019-09-10 03:38:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:25,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:25,349 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] [2019-09-10 03:38:25,350 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1934388280, now seen corresponding path program 1 times [2019-09-10 03:38:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:25,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:25,540 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:38:25,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:25,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:25,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:25,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:25,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:25,543 INFO L87 Difference]: Start difference. First operand 470 states and 688 transitions. Second operand 5 states. [2019-09-10 03:38:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:26,494 INFO L93 Difference]: Finished difference Result 540 states and 819 transitions. [2019-09-10 03:38:26,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:26,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:26,498 INFO L225 Difference]: With dead ends: 540 [2019-09-10 03:38:26,498 INFO L226 Difference]: Without dead ends: 540 [2019-09-10 03:38:26,499 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:38:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-10 03:38:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 470. [2019-09-10 03:38:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 687 transitions. [2019-09-10 03:38:26,516 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 687 transitions. Word has length 232 [2019-09-10 03:38:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:26,517 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 687 transitions. [2019-09-10 03:38:26,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 687 transitions. [2019-09-10 03:38:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:26,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:26,521 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] [2019-09-10 03:38:26,521 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1650402742, now seen corresponding path program 1 times [2019-09-10 03:38:26,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:26,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:26,667 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:38:26,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:26,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:26,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:26,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:26,670 INFO L87 Difference]: Start difference. First operand 470 states and 687 transitions. Second operand 5 states. [2019-09-10 03:38:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:27,632 INFO L93 Difference]: Finished difference Result 538 states and 814 transitions. [2019-09-10 03:38:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:27,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:27,636 INFO L225 Difference]: With dead ends: 538 [2019-09-10 03:38:27,636 INFO L226 Difference]: Without dead ends: 538 [2019-09-10 03:38:27,637 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:38:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-10 03:38:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 470. [2019-09-10 03:38:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 686 transitions. [2019-09-10 03:38:27,656 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 686 transitions. Word has length 232 [2019-09-10 03:38:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:27,656 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 686 transitions. [2019-09-10 03:38:27,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 686 transitions. [2019-09-10 03:38:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:27,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:27,659 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] [2019-09-10 03:38:27,659 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash 714062728, now seen corresponding path program 1 times [2019-09-10 03:38:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:27,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:27,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:27,816 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:38:27,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:27,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:27,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:27,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:27,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:27,818 INFO L87 Difference]: Start difference. First operand 470 states and 686 transitions. Second operand 5 states. [2019-09-10 03:38:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:28,742 INFO L93 Difference]: Finished difference Result 536 states and 809 transitions. [2019-09-10 03:38:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:28,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:28,747 INFO L225 Difference]: With dead ends: 536 [2019-09-10 03:38:28,747 INFO L226 Difference]: Without dead ends: 536 [2019-09-10 03:38:28,747 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:38:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-10 03:38:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 470. [2019-09-10 03:38:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 685 transitions. [2019-09-10 03:38:28,762 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 685 transitions. Word has length 232 [2019-09-10 03:38:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:28,763 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 685 transitions. [2019-09-10 03:38:28,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 685 transitions. [2019-09-10 03:38:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:28,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:28,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:28,766 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:28,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1010779510, now seen corresponding path program 1 times [2019-09-10 03:38:28,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:28,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:28,879 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:38:28,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:28,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:28,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:28,881 INFO L87 Difference]: Start difference. First operand 470 states and 685 transitions. Second operand 5 states. [2019-09-10 03:38:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:29,871 INFO L93 Difference]: Finished difference Result 534 states and 804 transitions. [2019-09-10 03:38:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:29,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:29,875 INFO L225 Difference]: With dead ends: 534 [2019-09-10 03:38:29,875 INFO L226 Difference]: Without dead ends: 534 [2019-09-10 03:38:29,876 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:38:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-10 03:38:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 470. [2019-09-10 03:38:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 684 transitions. [2019-09-10 03:38:29,893 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 684 transitions. Word has length 232 [2019-09-10 03:38:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:29,894 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 684 transitions. [2019-09-10 03:38:29,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 684 transitions. [2019-09-10 03:38:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:29,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:29,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] [2019-09-10 03:38:29,897 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1288885064, now seen corresponding path program 1 times [2019-09-10 03:38:29,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:29,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:29,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:29,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:30,016 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:38:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:30,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:30,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:30,019 INFO L87 Difference]: Start difference. First operand 470 states and 684 transitions. Second operand 5 states. [2019-09-10 03:38:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:30,970 INFO L93 Difference]: Finished difference Result 532 states and 799 transitions. [2019-09-10 03:38:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:30,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:30,979 INFO L225 Difference]: With dead ends: 532 [2019-09-10 03:38:30,981 INFO L226 Difference]: Without dead ends: 532 [2019-09-10 03:38:30,982 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:38:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-10 03:38:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 470. [2019-09-10 03:38:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 683 transitions. [2019-09-10 03:38:31,002 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 683 transitions. Word has length 232 [2019-09-10 03:38:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:31,003 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 683 transitions. [2019-09-10 03:38:31,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 683 transitions. [2019-09-10 03:38:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:31,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:31,007 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] [2019-09-10 03:38:31,007 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash -992236854, now seen corresponding path program 1 times [2019-09-10 03:38:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:31,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:31,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:31,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:31,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:31,135 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:38:31,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:31,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:31,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:31,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:31,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:31,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:31,137 INFO L87 Difference]: Start difference. First operand 470 states and 683 transitions. Second operand 5 states. [2019-09-10 03:38:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:31,990 INFO L93 Difference]: Finished difference Result 528 states and 790 transitions. [2019-09-10 03:38:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:31,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:31,995 INFO L225 Difference]: With dead ends: 528 [2019-09-10 03:38:31,995 INFO L226 Difference]: Without dead ends: 528 [2019-09-10 03:38:31,995 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:38:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-10 03:38:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 470. [2019-09-10 03:38:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 682 transitions. [2019-09-10 03:38:32,009 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 682 transitions. Word has length 232 [2019-09-10 03:38:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:32,010 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 682 transitions. [2019-09-10 03:38:32,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 682 transitions. [2019-09-10 03:38:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:32,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:32,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:32,012 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1222146764, now seen corresponding path program 1 times [2019-09-10 03:38:32,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:32,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:32,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:32,152 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:38:32,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:32,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:32,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:32,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:32,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:32,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:32,153 INFO L87 Difference]: Start difference. First operand 470 states and 682 transitions. Second operand 5 states. [2019-09-10 03:38:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:33,037 INFO L93 Difference]: Finished difference Result 526 states and 785 transitions. [2019-09-10 03:38:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:33,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:33,042 INFO L225 Difference]: With dead ends: 526 [2019-09-10 03:38:33,042 INFO L226 Difference]: Without dead ends: 526 [2019-09-10 03:38:33,042 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:38:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-10 03:38:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 470. [2019-09-10 03:38:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 681 transitions. [2019-09-10 03:38:33,056 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 681 transitions. Word has length 232 [2019-09-10 03:38:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:33,056 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 681 transitions. [2019-09-10 03:38:33,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 681 transitions. [2019-09-10 03:38:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:33,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:33,058 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] [2019-09-10 03:38:33,058 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1709220490, now seen corresponding path program 1 times [2019-09-10 03:38:33,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:33,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:33,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:33,193 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:38:33,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:33,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:33,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:33,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:33,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:33,195 INFO L87 Difference]: Start difference. First operand 470 states and 681 transitions. Second operand 5 states. [2019-09-10 03:38:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:34,172 INFO L93 Difference]: Finished difference Result 524 states and 780 transitions. [2019-09-10 03:38:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:34,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:34,176 INFO L225 Difference]: With dead ends: 524 [2019-09-10 03:38:34,176 INFO L226 Difference]: Without dead ends: 524 [2019-09-10 03:38:34,176 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:38:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-10 03:38:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 470. [2019-09-10 03:38:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 680 transitions. [2019-09-10 03:38:34,189 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 680 transitions. Word has length 232 [2019-09-10 03:38:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:34,189 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 680 transitions. [2019-09-10 03:38:34,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 680 transitions. [2019-09-10 03:38:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:34,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:34,192 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] [2019-09-10 03:38:34,192 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -76182772, now seen corresponding path program 1 times [2019-09-10 03:38:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:34,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:34,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:34,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:34,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:34,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:34,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:34,311 INFO L87 Difference]: Start difference. First operand 470 states and 680 transitions. Second operand 5 states. [2019-09-10 03:38:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:35,258 INFO L93 Difference]: Finished difference Result 522 states and 775 transitions. [2019-09-10 03:38:35,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:35,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:35,263 INFO L225 Difference]: With dead ends: 522 [2019-09-10 03:38:35,263 INFO L226 Difference]: Without dead ends: 522 [2019-09-10 03:38:35,263 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:38:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-10 03:38:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 470. [2019-09-10 03:38:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 679 transitions. [2019-09-10 03:38:35,293 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 679 transitions. Word has length 232 [2019-09-10 03:38:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:35,294 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 679 transitions. [2019-09-10 03:38:35,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 679 transitions. [2019-09-10 03:38:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:35,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:35,297 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] [2019-09-10 03:38:35,298 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -549418422, now seen corresponding path program 1 times [2019-09-10 03:38:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:35,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:35,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:35,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:35,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:35,430 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:38:35,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:35,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:35,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:35,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:35,433 INFO L87 Difference]: Start difference. First operand 470 states and 679 transitions. Second operand 5 states. [2019-09-10 03:38:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:36,339 INFO L93 Difference]: Finished difference Result 520 states and 770 transitions. [2019-09-10 03:38:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:36,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:36,344 INFO L225 Difference]: With dead ends: 520 [2019-09-10 03:38:36,344 INFO L226 Difference]: Without dead ends: 520 [2019-09-10 03:38:36,344 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:38:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-10 03:38:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 470. [2019-09-10 03:38:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 678 transitions. [2019-09-10 03:38:36,359 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 678 transitions. Word has length 232 [2019-09-10 03:38:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:36,360 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 678 transitions. [2019-09-10 03:38:36,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 678 transitions. [2019-09-10 03:38:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:36,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:36,362 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] [2019-09-10 03:38:36,362 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -426136756, now seen corresponding path program 1 times [2019-09-10 03:38:36,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:36,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:36,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:36,541 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:38:36,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:36,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:36,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:36,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:36,545 INFO L87 Difference]: Start difference. First operand 470 states and 678 transitions. Second operand 5 states. [2019-09-10 03:38:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:37,566 INFO L93 Difference]: Finished difference Result 518 states and 765 transitions. [2019-09-10 03:38:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:37,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:37,571 INFO L225 Difference]: With dead ends: 518 [2019-09-10 03:38:37,572 INFO L226 Difference]: Without dead ends: 518 [2019-09-10 03:38:37,574 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:38:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-10 03:38:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 470. [2019-09-10 03:38:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 677 transitions. [2019-09-10 03:38:37,594 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 677 transitions. Word has length 232 [2019-09-10 03:38:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:37,594 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 677 transitions. [2019-09-10 03:38:37,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 677 transitions. [2019-09-10 03:38:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:37,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:37,598 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] [2019-09-10 03:38:37,599 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1794597386, now seen corresponding path program 1 times [2019-09-10 03:38:37,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:37,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:37,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:37,806 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:38:37,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:37,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:37,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:37,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:37,810 INFO L87 Difference]: Start difference. First operand 470 states and 677 transitions. Second operand 5 states. [2019-09-10 03:38:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:39,254 INFO L93 Difference]: Finished difference Result 565 states and 852 transitions. [2019-09-10 03:38:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:39,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:39,260 INFO L225 Difference]: With dead ends: 565 [2019-09-10 03:38:39,260 INFO L226 Difference]: Without dead ends: 565 [2019-09-10 03:38:39,260 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:38:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-10 03:38:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 470. [2019-09-10 03:38:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 676 transitions. [2019-09-10 03:38:39,286 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 676 transitions. Word has length 232 [2019-09-10 03:38:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:39,287 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 676 transitions. [2019-09-10 03:38:39,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 676 transitions. [2019-09-10 03:38:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:39,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:39,291 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] [2019-09-10 03:38:39,291 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1597449332, now seen corresponding path program 1 times [2019-09-10 03:38:39,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:39,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:39,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:39,457 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:38:39,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:39,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:39,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:39,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:39,460 INFO L87 Difference]: Start difference. First operand 470 states and 676 transitions. Second operand 5 states. [2019-09-10 03:38:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:40,744 INFO L93 Difference]: Finished difference Result 561 states and 843 transitions. [2019-09-10 03:38:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:40,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:40,749 INFO L225 Difference]: With dead ends: 561 [2019-09-10 03:38:40,749 INFO L226 Difference]: Without dead ends: 561 [2019-09-10 03:38:40,750 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:38:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-10 03:38:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 470. [2019-09-10 03:38:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 675 transitions. [2019-09-10 03:38:40,769 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 675 transitions. Word has length 232 [2019-09-10 03:38:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:40,770 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 675 transitions. [2019-09-10 03:38:40,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 675 transitions. [2019-09-10 03:38:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:40,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:40,774 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] [2019-09-10 03:38:40,774 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:40,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1605448306, now seen corresponding path program 1 times [2019-09-10 03:38:40,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:40,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:40,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:40,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:40,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:40,947 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:38:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:40,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:40,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:40,950 INFO L87 Difference]: Start difference. First operand 470 states and 675 transitions. Second operand 5 states. [2019-09-10 03:38:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:41,857 INFO L93 Difference]: Finished difference Result 559 states and 838 transitions. [2019-09-10 03:38:41,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:41,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:41,861 INFO L225 Difference]: With dead ends: 559 [2019-09-10 03:38:41,861 INFO L226 Difference]: Without dead ends: 559 [2019-09-10 03:38:41,861 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:38:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-10 03:38:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 470. [2019-09-10 03:38:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 674 transitions. [2019-09-10 03:38:41,874 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 674 transitions. Word has length 232 [2019-09-10 03:38:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:41,874 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 674 transitions. [2019-09-10 03:38:41,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 674 transitions. [2019-09-10 03:38:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:41,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:41,876 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] [2019-09-10 03:38:41,877 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash -81685684, now seen corresponding path program 1 times [2019-09-10 03:38:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:41,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:41,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:41,979 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:38:41,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:41,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:41,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:41,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:41,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:41,980 INFO L87 Difference]: Start difference. First operand 470 states and 674 transitions. Second operand 5 states. [2019-09-10 03:38:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:42,871 INFO L93 Difference]: Finished difference Result 557 states and 833 transitions. [2019-09-10 03:38:42,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:42,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:42,875 INFO L225 Difference]: With dead ends: 557 [2019-09-10 03:38:42,875 INFO L226 Difference]: Without dead ends: 557 [2019-09-10 03:38:42,875 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:38:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-10 03:38:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 470. [2019-09-10 03:38:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 673 transitions. [2019-09-10 03:38:42,888 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 673 transitions. Word has length 232 [2019-09-10 03:38:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:42,888 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 673 transitions. [2019-09-10 03:38:42,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 673 transitions. [2019-09-10 03:38:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:42,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:42,890 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] [2019-09-10 03:38:42,890 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1075846606, now seen corresponding path program 1 times [2019-09-10 03:38:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:42,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:42,995 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:38:42,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:42,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:42,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:42,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:42,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:42,998 INFO L87 Difference]: Start difference. First operand 470 states and 673 transitions. Second operand 5 states. [2019-09-10 03:38:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:43,952 INFO L93 Difference]: Finished difference Result 555 states and 828 transitions. [2019-09-10 03:38:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:43,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:43,956 INFO L225 Difference]: With dead ends: 555 [2019-09-10 03:38:43,956 INFO L226 Difference]: Without dead ends: 555 [2019-09-10 03:38:43,956 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:38:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-10 03:38:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 470. [2019-09-10 03:38:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 672 transitions. [2019-09-10 03:38:43,968 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 672 transitions. Word has length 232 [2019-09-10 03:38:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:43,969 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 672 transitions. [2019-09-10 03:38:43,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 672 transitions. [2019-09-10 03:38:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:43,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:43,971 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] [2019-09-10 03:38:43,971 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash -272286964, now seen corresponding path program 1 times [2019-09-10 03:38:43,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:43,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:44,071 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:38:44,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:44,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:44,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:44,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:44,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:44,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:44,074 INFO L87 Difference]: Start difference. First operand 470 states and 672 transitions. Second operand 5 states. [2019-09-10 03:38:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:44,990 INFO L93 Difference]: Finished difference Result 553 states and 823 transitions. [2019-09-10 03:38:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:44,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:44,993 INFO L225 Difference]: With dead ends: 553 [2019-09-10 03:38:44,993 INFO L226 Difference]: Without dead ends: 553 [2019-09-10 03:38:44,994 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:38:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-10 03:38:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 470. [2019-09-10 03:38:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 671 transitions. [2019-09-10 03:38:45,006 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 671 transitions. Word has length 232 [2019-09-10 03:38:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:45,007 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 671 transitions. [2019-09-10 03:38:45,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 671 transitions. [2019-09-10 03:38:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:45,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:45,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:45,009 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1485340174, now seen corresponding path program 1 times [2019-09-10 03:38:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:45,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:45,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:45,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:45,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:45,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:45,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:45,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:45,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:45,112 INFO L87 Difference]: Start difference. First operand 470 states and 671 transitions. Second operand 5 states. [2019-09-10 03:38:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:46,181 INFO L93 Difference]: Finished difference Result 551 states and 818 transitions. [2019-09-10 03:38:46,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:46,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:46,184 INFO L225 Difference]: With dead ends: 551 [2019-09-10 03:38:46,184 INFO L226 Difference]: Without dead ends: 551 [2019-09-10 03:38:46,184 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:38:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-10 03:38:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 470. [2019-09-10 03:38:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 670 transitions. [2019-09-10 03:38:46,197 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 670 transitions. Word has length 232 [2019-09-10 03:38:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:46,198 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 670 transitions. [2019-09-10 03:38:46,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 670 transitions. [2019-09-10 03:38:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:46,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:46,200 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] [2019-09-10 03:38:46,200 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1957679820, now seen corresponding path program 1 times [2019-09-10 03:38:46,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:46,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:46,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:46,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:46,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:46,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:46,313 INFO L87 Difference]: Start difference. First operand 470 states and 670 transitions. Second operand 5 states. [2019-09-10 03:38:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:47,199 INFO L93 Difference]: Finished difference Result 549 states and 813 transitions. [2019-09-10 03:38:47,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:47,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:47,202 INFO L225 Difference]: With dead ends: 549 [2019-09-10 03:38:47,202 INFO L226 Difference]: Without dead ends: 549 [2019-09-10 03:38:47,203 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:38:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-10 03:38:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 470. [2019-09-10 03:38:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 669 transitions. [2019-09-10 03:38:47,214 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 669 transitions. Word has length 232 [2019-09-10 03:38:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:47,215 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 669 transitions. [2019-09-10 03:38:47,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 669 transitions. [2019-09-10 03:38:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:47,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:47,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] [2019-09-10 03:38:47,217 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:47,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1141632590, now seen corresponding path program 1 times [2019-09-10 03:38:47,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:47,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:47,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:47,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:47,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:47,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:47,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:47,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:47,313 INFO L87 Difference]: Start difference. First operand 470 states and 669 transitions. Second operand 5 states. [2019-09-10 03:38:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:48,212 INFO L93 Difference]: Finished difference Result 545 states and 804 transitions. [2019-09-10 03:38:48,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:48,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:48,215 INFO L225 Difference]: With dead ends: 545 [2019-09-10 03:38:48,215 INFO L226 Difference]: Without dead ends: 545 [2019-09-10 03:38:48,215 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:38:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-10 03:38:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 470. [2019-09-10 03:38:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 668 transitions. [2019-09-10 03:38:48,227 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 668 transitions. Word has length 232 [2019-09-10 03:38:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:48,227 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 668 transitions. [2019-09-10 03:38:48,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 668 transitions. [2019-09-10 03:38:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:48,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:48,229 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] [2019-09-10 03:38:48,229 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1554185648, now seen corresponding path program 1 times [2019-09-10 03:38:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:48,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:48,340 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:38:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:48,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:48,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:48,343 INFO L87 Difference]: Start difference. First operand 470 states and 668 transitions. Second operand 5 states. [2019-09-10 03:38:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:49,269 INFO L93 Difference]: Finished difference Result 543 states and 799 transitions. [2019-09-10 03:38:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:49,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:49,276 INFO L225 Difference]: With dead ends: 543 [2019-09-10 03:38:49,276 INFO L226 Difference]: Without dead ends: 543 [2019-09-10 03:38:49,276 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:38:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-10 03:38:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 470. [2019-09-10 03:38:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 667 transitions. [2019-09-10 03:38:49,288 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 667 transitions. Word has length 232 [2019-09-10 03:38:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:49,288 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 667 transitions. [2019-09-10 03:38:49,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 667 transitions. [2019-09-10 03:38:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:49,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:49,290 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] [2019-09-10 03:38:49,290 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -948410866, now seen corresponding path program 1 times [2019-09-10 03:38:49,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:49,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:49,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:49,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:49,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:49,386 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:38:49,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:49,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:49,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:49,388 INFO L87 Difference]: Start difference. First operand 470 states and 667 transitions. Second operand 5 states. [2019-09-10 03:38:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:50,293 INFO L93 Difference]: Finished difference Result 541 states and 794 transitions. [2019-09-10 03:38:50,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:50,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 03:38:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:50,296 INFO L225 Difference]: With dead ends: 541 [2019-09-10 03:38:50,296 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 03:38:50,297 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:38:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 03:38:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 470. [2019-09-10 03:38:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:38:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 666 transitions. [2019-09-10 03:38:50,308 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 666 transitions. Word has length 232 [2019-09-10 03:38:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:50,308 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 666 transitions. [2019-09-10 03:38:50,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 666 transitions. [2019-09-10 03:38:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:38:50,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:50,310 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] [2019-09-10 03:38:50,311 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -928869744, now seen corresponding path program 1 times [2019-09-10 03:38:50,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:50,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:50,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:50,416 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:38:50,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:50,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:50,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:50,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:50,418 INFO L87 Difference]: Start difference. First operand 470 states and 666 transitions. Second operand 4 states. [2019-09-10 03:38:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:50,844 INFO L93 Difference]: Finished difference Result 897 states and 1267 transitions. [2019-09-10 03:38:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:50,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 03:38:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:50,851 INFO L225 Difference]: With dead ends: 897 [2019-09-10 03:38:50,851 INFO L226 Difference]: Without dead ends: 897 [2019-09-10 03:38:50,851 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:38:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-10 03:38:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 896. [2019-09-10 03:38:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-10 03:38:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1266 transitions. [2019-09-10 03:38:50,872 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1266 transitions. Word has length 232 [2019-09-10 03:38:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:50,873 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1266 transitions. [2019-09-10 03:38:50,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1266 transitions. [2019-09-10 03:38:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:38:50,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:50,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,877 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash 147513171, now seen corresponding path program 1 times [2019-09-10 03:38:50,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:50,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-10 03:38:51,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:51,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:51,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2019-09-10 03:38:51,047 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [43], [44], [277], [282], [285], [288], [291], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [672], [673], [674], [677], [680], [688], [689], [691], [692], [694], [697], [702], [705], [710], [713], [718], [721], [726], [729], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [910], [911], [912], [915], [918], [926], [927], [930], [936], [944], [948], [954], [960], [966], [972], [978], [984], [992], [996], [1002], [1008], [1014], [1020], [1026], [1032], [1040], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:38:51,127 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:51,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:51,344 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:51,346 INFO L272 AbstractInterpreter]: Visited 71 different actions 71 times. Never merged. Never widened. Performed 742 root evaluator evaluations with a maximum evaluation depth of 3. Performed 742 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:38:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:51,365 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:51,641 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 67.5% of their original sizes. [2019-09-10 03:38:51,641 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:52,117 INFO L420 sIntCurrentIteration]: We unified 386 AI predicates to 386 [2019-09-10 03:38:52,117 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:52,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:52,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2019-09-10 03:38:52,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:52,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:38:52,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:38:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:38:52,120 INFO L87 Difference]: Start difference. First operand 896 states and 1266 transitions. Second operand 20 states. [2019-09-10 03:38:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:59,850 INFO L93 Difference]: Finished difference Result 1201 states and 1632 transitions. [2019-09-10 03:38:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:38:59,851 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 387 [2019-09-10 03:38:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:59,856 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 03:38:59,856 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 03:38:59,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=350, Unknown=0, NotChecked=0, Total=552 [2019-09-10 03:38:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 03:38:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1173. [2019-09-10 03:38:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-09-10 03:38:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1603 transitions. [2019-09-10 03:38:59,881 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1603 transitions. Word has length 387 [2019-09-10 03:38:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:59,881 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1603 transitions. [2019-09-10 03:38:59,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:38:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1603 transitions. [2019-09-10 03:38:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-10 03:38:59,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:59,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,887 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash -103414990, now seen corresponding path program 1 times [2019-09-10 03:38:59,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:59,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:59,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-10 03:39:00,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:00,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:00,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 417 with the following transitions: [2019-09-10 03:39:00,062 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [76], [92], [94], [102], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [710], [713], [718], [721], [726], [729], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1300], [1313], [1317], [1320], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1670], [1671], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:39:00,070 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:00,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:00,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:00,113 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Performed 817 root evaluator evaluations with a maximum evaluation depth of 4. Performed 817 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:39:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:00,113 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:00,273 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 67.27% of their original sizes. [2019-09-10 03:39:00,273 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:00,959 INFO L420 sIntCurrentIteration]: We unified 415 AI predicates to 415 [2019-09-10 03:39:00,959 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:00,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:00,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2019-09-10 03:39:00,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:00,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 03:39:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 03:39:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:39:00,961 INFO L87 Difference]: Start difference. First operand 1173 states and 1603 transitions. Second operand 25 states. [2019-09-10 03:39:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:11,940 INFO L93 Difference]: Finished difference Result 1189 states and 1605 transitions. [2019-09-10 03:39:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:39:11,941 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 416 [2019-09-10 03:39:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:11,945 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:39:11,946 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:39:11,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:39:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:39:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:39:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:39:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1576 transitions. [2019-09-10 03:39:11,969 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1576 transitions. Word has length 416 [2019-09-10 03:39:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:11,969 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1576 transitions. [2019-09-10 03:39:11,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 03:39:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1576 transitions. [2019-09-10 03:39:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:39:11,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:11,975 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,975 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -370248766, now seen corresponding path program 1 times [2019-09-10 03:39:11,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:11,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:11,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-10 03:39:12,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:12,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:12,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:39:12,184 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [76], [92], [94], [102], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [718], [721], [726], [729], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1313], [1317], [1320], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1670], [1671], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:39:12,192 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:12,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:12,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:12,250 INFO L272 AbstractInterpreter]: Visited 92 different actions 92 times. Never merged. Never widened. Performed 891 root evaluator evaluations with a maximum evaluation depth of 4. Performed 891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:39:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:12,250 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:12,395 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 66.96% of their original sizes. [2019-09-10 03:39:12,395 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:13,321 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:39:13,321 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:13,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:13,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [6] total 33 [2019-09-10 03:39:13,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:13,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 03:39:13,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 03:39:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:39:13,323 INFO L87 Difference]: Start difference. First operand 1161 states and 1576 transitions. Second operand 29 states. [2019-09-10 03:39:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:39,505 INFO L93 Difference]: Finished difference Result 1189 states and 1603 transitions. [2019-09-10 03:39:39,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:39:39,506 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 417 [2019-09-10 03:39:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:39,510 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:39:39,510 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:39:39,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=440, Invalid=1366, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:39:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:39:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:39:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:39:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1574 transitions. [2019-09-10 03:39:39,535 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1574 transitions. Word has length 417 [2019-09-10 03:39:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:39,536 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1574 transitions. [2019-09-10 03:39:39,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 03:39:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1574 transitions. [2019-09-10 03:39:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:39:39,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:39,541 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] [2019-09-10 03:39:39,541 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1466418895, now seen corresponding path program 1 times [2019-09-10 03:39:39,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:39,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:39,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:39,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:39,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:39:39,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:39,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:39,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:39:39,761 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [726], [729], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1304], [1307], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1668], [1669], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:39:39,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:39,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:39,871 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:39,873 INFO L272 AbstractInterpreter]: Visited 102 different actions 102 times. Never merged. Never widened. Performed 965 root evaluator evaluations with a maximum evaluation depth of 4. Performed 965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:39:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:39,873 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:40,089 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 66.57% of their original sizes. [2019-09-10 03:39:40,089 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:41,376 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:39:41,376 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [6] total 37 [2019-09-10 03:39:41,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:41,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 03:39:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 03:39:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:39:41,378 INFO L87 Difference]: Start difference. First operand 1161 states and 1574 transitions. Second operand 33 states. [2019-09-10 03:40:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:12,970 INFO L93 Difference]: Finished difference Result 1189 states and 1601 transitions. [2019-09-10 03:40:12,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:40:12,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 417 [2019-09-10 03:40:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:12,977 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:40:12,977 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:40:12,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 03:40:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:40:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:40:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:40:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1572 transitions. [2019-09-10 03:40:13,000 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1572 transitions. Word has length 417 [2019-09-10 03:40:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:13,000 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1572 transitions. [2019-09-10 03:40:13,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 03:40:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1572 transitions. [2019-09-10 03:40:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:40:13,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:13,005 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] [2019-09-10 03:40:13,006 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 313921165, now seen corresponding path program 1 times [2019-09-10 03:40:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:13,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-10 03:40:13,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:13,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:13,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:40:13,159 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1304], [1307], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1668], [1669], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:40:13,162 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:13,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:13,226 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:13,226 INFO L272 AbstractInterpreter]: Visited 113 different actions 113 times. Never merged. Never widened. Performed 1040 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1040 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:40:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:13,226 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:13,402 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 66.14% of their original sizes. [2019-09-10 03:40:13,402 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:14,915 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:40:14,915 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:14,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:14,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [6] total 41 [2019-09-10 03:40:14,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:14,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 03:40:14,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 03:40:14,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:40:14,917 INFO L87 Difference]: Start difference. First operand 1161 states and 1572 transitions. Second operand 37 states. [2019-09-10 03:40:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:37,103 INFO L93 Difference]: Finished difference Result 1189 states and 1599 transitions. [2019-09-10 03:40:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:40:37,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 417 [2019-09-10 03:40:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:37,108 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:40:37,108 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:40:37,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=701, Invalid=2959, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:40:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:40:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:40:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:40:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1570 transitions. [2019-09-10 03:40:37,130 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1570 transitions. Word has length 417 [2019-09-10 03:40:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:37,131 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1570 transitions. [2019-09-10 03:40:37,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 03:40:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1570 transitions. [2019-09-10 03:40:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:40:37,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:37,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,136 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 58274573, now seen corresponding path program 1 times [2019-09-10 03:40:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:37,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:37,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:40:37,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:37,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:37,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2019-09-10 03:40:37,282 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:40:37,284 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:37,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:37,324 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:37,325 INFO L272 AbstractInterpreter]: Visited 123 different actions 123 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 160 variables. [2019-09-10 03:40:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:37,325 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:37,508 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 68.19% of their original sizes. [2019-09-10 03:40:37,509 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:39,160 INFO L420 sIntCurrentIteration]: We unified 386 AI predicates to 386 [2019-09-10 03:40:39,161 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:39,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:39,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [6] total 45 [2019-09-10 03:40:39,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:39,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 03:40:39,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 03:40:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:40:39,163 INFO L87 Difference]: Start difference. First operand 1161 states and 1570 transitions. Second operand 41 states. [2019-09-10 03:41:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:41:20,023 INFO L93 Difference]: Finished difference Result 1189 states and 1598 transitions. [2019-09-10 03:41:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 03:41:20,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 387 [2019-09-10 03:41:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:41:20,028 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:41:20,028 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:41:20,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=764, Invalid=3526, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:41:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:41:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:41:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:41:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1569 transitions. [2019-09-10 03:41:20,050 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1569 transitions. Word has length 387 [2019-09-10 03:41:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:41:20,050 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1569 transitions. [2019-09-10 03:41:20,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 03:41:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1569 transitions. [2019-09-10 03:41:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:41:20,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:41:20,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,056 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:41:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash 873845837, now seen corresponding path program 1 times [2019-09-10 03:41:20,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:41:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:41:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:20,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:41:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:41:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-10 03:41:20,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:41:20,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:41:20,219 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:41:20,219 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1304], [1307], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1668], [1669], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:41:20,223 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:41:20,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:41:20,273 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:41:20,273 INFO L272 AbstractInterpreter]: Visited 133 different actions 133 times. Never merged. Never widened. Performed 1188 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:41:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:20,274 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:41:20,449 INFO L227 lantSequenceWeakener]: Weakened 123 states. On average, predicates are now at 65.18% of their original sizes. [2019-09-10 03:41:20,450 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:41:22,906 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:41:22,906 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:41:22,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:41:22,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [6] total 49 [2019-09-10 03:41:22,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:41:22,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 03:41:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 03:41:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1795, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:41:22,908 INFO L87 Difference]: Start difference. First operand 1161 states and 1569 transitions. Second operand 45 states. [2019-09-10 03:42:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:03,127 INFO L93 Difference]: Finished difference Result 1189 states and 1595 transitions. [2019-09-10 03:42:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 03:42:03,127 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 417 [2019-09-10 03:42:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:03,132 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:42:03,132 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:42:03,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1022, Invalid=5140, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 03:42:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:42:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:42:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:42:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1566 transitions. [2019-09-10 03:42:03,156 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1566 transitions. Word has length 417 [2019-09-10 03:42:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:03,156 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1566 transitions. [2019-09-10 03:42:03,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 03:42:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1566 transitions. [2019-09-10 03:42:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:42:03,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:03,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,161 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash -442407603, now seen corresponding path program 1 times [2019-09-10 03:42:03,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:03,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:03,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 03:42:03,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:03,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:03,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2019-09-10 03:42:03,368 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:42:03,370 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:03,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:03,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:03,449 INFO L272 AbstractInterpreter]: Visited 144 different actions 144 times. Never merged. Never widened. Performed 1263 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1263 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:42:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:03,450 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:03,623 INFO L227 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 68.49% of their original sizes. [2019-09-10 03:42:03,623 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:06,110 INFO L420 sIntCurrentIteration]: We unified 386 AI predicates to 386 [2019-09-10 03:42:06,110 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:06,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:06,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [6] total 53 [2019-09-10 03:42:06,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:06,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 03:42:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 03:42:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2101, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 03:42:06,113 INFO L87 Difference]: Start difference. First operand 1161 states and 1566 transitions. Second operand 49 states. [2019-09-10 03:42:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:54,778 INFO L93 Difference]: Finished difference Result 1189 states and 1594 transitions. [2019-09-10 03:42:54,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 03:42:54,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 387 [2019-09-10 03:42:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:54,782 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:42:54,782 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:42:54,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1004, Invalid=5638, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 03:42:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:42:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:42:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:42:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1565 transitions. [2019-09-10 03:42:54,807 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1565 transitions. Word has length 387 [2019-09-10 03:42:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:54,808 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1565 transitions. [2019-09-10 03:42:54,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 03:42:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1565 transitions. [2019-09-10 03:42:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:42:54,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:54,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,813 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash 106132619, now seen corresponding path program 1 times [2019-09-10 03:42:54,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:42:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:55,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:55,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2019-09-10 03:42:55,024 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:42:55,027 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:55,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:55,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:55,110 INFO L272 AbstractInterpreter]: Visited 155 different actions 155 times. Never merged. Never widened. Performed 1338 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1338 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:42:55,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:55,111 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:55,298 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 68.61% of their original sizes. [2019-09-10 03:42:55,299 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:58,200 INFO L420 sIntCurrentIteration]: We unified 386 AI predicates to 386 [2019-09-10 03:42:58,200 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:58,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:58,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [6] total 57 [2019-09-10 03:42:58,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:58,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 03:42:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 03:42:58,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2489, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:42:58,203 INFO L87 Difference]: Start difference. First operand 1161 states and 1565 transitions. Second operand 53 states. [2019-09-10 03:43:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:43:41,158 INFO L93 Difference]: Finished difference Result 1189 states and 1593 transitions. [2019-09-10 03:43:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:43:41,158 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 387 [2019-09-10 03:43:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:43:41,163 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:43:41,163 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:43:41,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1130, Invalid=6880, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 03:43:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:43:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:43:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:43:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1564 transitions. [2019-09-10 03:43:41,185 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1564 transitions. Word has length 387 [2019-09-10 03:43:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:43:41,186 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1564 transitions. [2019-09-10 03:43:41,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 03:43:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1564 transitions. [2019-09-10 03:43:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:43:41,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:43:41,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,191 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:43:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2018505329, now seen corresponding path program 1 times [2019-09-10 03:43:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:43:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:43:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:41,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:43:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:43:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 03:43:41,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:43:41,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:43:41,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:43:41,338 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1304], [1307], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1668], [1669], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:43:41,341 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:43:41,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:43:41,397 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:43:41,398 INFO L272 AbstractInterpreter]: Visited 166 different actions 166 times. Never merged. Never widened. Performed 1413 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1413 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:43:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:41,398 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:43:41,541 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 63.59% of their original sizes. [2019-09-10 03:43:41,541 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:43:46,046 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:43:46,047 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:43:46,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:43:46,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2019-09-10 03:43:46,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:43:46,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 03:43:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 03:43:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2977, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:43:46,049 INFO L87 Difference]: Start difference. First operand 1161 states and 1564 transitions. Second operand 57 states. [2019-09-10 03:44:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:44:50,033 INFO L93 Difference]: Finished difference Result 1189 states and 1589 transitions. [2019-09-10 03:44:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 03:44:50,034 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 417 [2019-09-10 03:44:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:44:50,039 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:44:50,039 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:44:50,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1616, Invalid=9514, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 03:44:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:44:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:44:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:44:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1560 transitions. [2019-09-10 03:44:50,065 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1560 transitions. Word has length 417 [2019-09-10 03:44:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:44:50,066 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1560 transitions. [2019-09-10 03:44:50,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 03:44:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1560 transitions. [2019-09-10 03:44:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:44:50,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:44:50,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,071 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:44:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1635831859, now seen corresponding path program 1 times [2019-09-10 03:44:50,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:44:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:44:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:50,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:44:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:44:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-10 03:44:50,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:44:50,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:44:50,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:44:50,245 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1304], [1307], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1668], [1669], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:44:50,249 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:44:50,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:44:50,325 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:44:50,326 INFO L272 AbstractInterpreter]: Visited 176 different actions 176 times. Never merged. Never widened. Performed 1487 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1487 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:44:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:50,326 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:44:50,505 INFO L227 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 63.04% of their original sizes. [2019-09-10 03:44:50,505 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:44:55,572 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:44:55,572 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:44:55,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:44:55,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [6] total 65 [2019-09-10 03:44:55,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:44:55,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 03:44:55,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 03:44:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3433, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:44:55,574 INFO L87 Difference]: Start difference. First operand 1161 states and 1560 transitions. Second operand 61 states. [2019-09-10 03:46:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:05,094 INFO L93 Difference]: Finished difference Result 1189 states and 1587 transitions. [2019-09-10 03:46:05,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 03:46:05,094 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 417 [2019-09-10 03:46:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:05,098 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:46:05,099 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:46:05,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1844, Invalid=11266, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 03:46:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:46:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:46:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:46:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1558 transitions. [2019-09-10 03:46:05,118 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1558 transitions. Word has length 417 [2019-09-10 03:46:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:05,119 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1558 transitions. [2019-09-10 03:46:05,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 03:46:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1558 transitions. [2019-09-10 03:46:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-10 03:46:05,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:05,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,125 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1870327759, now seen corresponding path program 1 times [2019-09-10 03:46:05,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:05,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:05,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-10 03:46:05,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:46:05,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:46:05,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-10 03:46:05,291 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1297], [1304], [1307], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1668], [1669], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:46:05,295 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:46:05,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:46:05,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:46:05,395 INFO L272 AbstractInterpreter]: Visited 187 different actions 187 times. Never merged. Never widened. Performed 1562 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:46:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:05,396 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:46:05,548 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 62.47% of their original sizes. [2019-09-10 03:46:05,549 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:46:11,749 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-10 03:46:11,750 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:46:11,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:46:11,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [6] total 69 [2019-09-10 03:46:11,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:11,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 03:46:11,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 03:46:11,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3920, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:46:11,753 INFO L87 Difference]: Start difference. First operand 1161 states and 1558 transitions. Second operand 65 states. [2019-09-10 03:47:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:33,141 INFO L93 Difference]: Finished difference Result 1189 states and 1585 transitions. [2019-09-10 03:47:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 03:47:33,141 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 417 [2019-09-10 03:47:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:33,145 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:47:33,146 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:47:33,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2087, Invalid=13165, Unknown=0, NotChecked=0, Total=15252 [2019-09-10 03:47:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:47:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:47:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:47:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1556 transitions. [2019-09-10 03:47:33,169 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1556 transitions. Word has length 417 [2019-09-10 03:47:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:33,169 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1556 transitions. [2019-09-10 03:47:33,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 03:47:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1556 transitions. [2019-09-10 03:47:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:47:33,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:33,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,174 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:33,175 INFO L82 PathProgramCache]: Analyzing trace with hash 909234187, now seen corresponding path program 1 times [2019-09-10 03:47:33,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:33,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:33,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:33,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-10 03:47:33,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:47:33,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:47:33,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2019-09-10 03:47:33,342 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [697], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:47:33,347 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:47:33,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:47:33,455 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:47:33,455 INFO L272 AbstractInterpreter]: Visited 197 different actions 197 times. Never merged. Never widened. Performed 1636 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1636 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:47:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:33,456 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:47:33,614 INFO L227 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 69.02% of their original sizes. [2019-09-10 03:47:33,615 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:47:38,504 INFO L420 sIntCurrentIteration]: We unified 386 AI predicates to 386 [2019-09-10 03:47:38,504 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:47:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:47:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [6] total 73 [2019-09-10 03:47:38,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:38,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 03:47:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 03:47:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=4361, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 03:47:38,507 INFO L87 Difference]: Start difference. First operand 1161 states and 1556 transitions. Second operand 69 states. [2019-09-10 03:48:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:50,236 INFO L93 Difference]: Finished difference Result 1189 states and 1584 transitions. [2019-09-10 03:48:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:48:50,236 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 387 [2019-09-10 03:48:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:50,240 INFO L225 Difference]: With dead ends: 1189 [2019-09-10 03:48:50,240 INFO L226 Difference]: Without dead ends: 1189 [2019-09-10 03:48:50,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1674, Invalid=13088, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 03:48:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-10 03:48:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1161. [2019-09-10 03:48:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-10 03:48:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1555 transitions. [2019-09-10 03:48:50,258 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1555 transitions. Word has length 387 [2019-09-10 03:48:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:50,258 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1555 transitions. [2019-09-10 03:48:50,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 03:48:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1555 transitions. [2019-09-10 03:48:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:48:50,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:50,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:48:50,262 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash -404595699, now seen corresponding path program 1 times [2019-09-10 03:48:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:50,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-10 03:48:50,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:50,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:48:50,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:50,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:48:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:48:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:50,452 INFO L87 Difference]: Start difference. First operand 1161 states and 1555 transitions. Second operand 6 states. [2019-09-10 03:48:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:50,506 INFO L93 Difference]: Finished difference Result 1204 states and 1623 transitions. [2019-09-10 03:48:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:50,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 387 [2019-09-10 03:48:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:50,511 INFO L225 Difference]: With dead ends: 1204 [2019-09-10 03:48:50,511 INFO L226 Difference]: Without dead ends: 1204 [2019-09-10 03:48:50,512 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:48:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-09-10 03:48:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1166. [2019-09-10 03:48:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-09-10 03:48:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1559 transitions. [2019-09-10 03:48:50,532 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1559 transitions. Word has length 387 [2019-09-10 03:48:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:50,534 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1559 transitions. [2019-09-10 03:48:50,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:48:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1559 transitions. [2019-09-10 03:48:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-10 03:48:50,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:50,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:48:50,542 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1727774645, now seen corresponding path program 1 times [2019-09-10 03:48:50,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:50,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:50,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 03:48:50,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:48:50,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:48:50,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2019-09-10 03:48:50,863 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [285], [288], [291], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [476], [482], [484], [485], [495], [497], [499], [500], [658], [661], [664], [668], [670], [672], [673], [674], [677], [680], [684], [686], [688], [689], [691], [692], [694], [699], [702], [705], [707], [710], [713], [715], [718], [721], [723], [726], [729], [731], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [797], [827], [830], [894], [895], [896], [899], [902], [906], [908], [910], [911], [912], [915], [918], [922], [924], [926], [927], [932], [938], [944], [950], [956], [962], [968], [974], [980], [986], [992], [998], [1004], [1010], [1016], [1022], [1028], [1034], [1040], [1046], [1052], [1058], [1064], [1070], [1076], [1082], [1084], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1153], [1159], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1190], [1192], [1194], [1195], [1196], [1199], [1201], [1204], [1215], [1217], [1219], [1223], [1249], [1252], [1253], [1254], [1264], [1266], [1268], [1269], [1270], [1279], [1282], [1285], [1291], [1294], [1313], [1326], [1339], [1352], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1462], [1472], [1474], [1476], [1477], [1478], [1488], [1490], [1492], [1493], [1494], [1495], [1509], [1511], [1602], [1603], [1622], [1623], [1624], [1628], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1664], [1665], [1666], [1667], [1692], [1693], [1694], [1695], [1696], [1697], [1698], [1699], [1700], [1701], [1702], [1722], [1723], [1724] [2019-09-10 03:48:50,866 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:48:50,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:48:51,149 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:48:51,150 INFO L272 AbstractInterpreter]: Visited 258 different actions 395 times. Never merged. Never widened. Performed 3127 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 160 variables. [2019-09-10 03:48:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:51,150 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:48:51,628 INFO L227 lantSequenceWeakener]: Weakened 364 states. On average, predicates are now at 78.01% of their original sizes. [2019-09-10 03:48:51,628 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:49:09,440 INFO L420 sIntCurrentIteration]: We unified 386 AI predicates to 386 [2019-09-10 03:49:09,440 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:49:09,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:49:09,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [176] imperfect sequences [4] total 178 [2019-09-10 03:49:09,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:09,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-09-10 03:49:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-09-10 03:49:09,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2271, Invalid=28529, Unknown=0, NotChecked=0, Total=30800 [2019-09-10 03:49:09,445 INFO L87 Difference]: Start difference. First operand 1166 states and 1559 transitions. Second operand 176 states.