java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.11.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:35:51,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:35:51,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:35:51,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:35:51,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:35:51,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:35:51,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:35:51,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:35:51,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:35:51,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:35:51,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:35:51,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:35:51,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:35:51,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:35:51,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:35:51,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:35:51,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:35:51,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:35:51,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:35:51,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:35:51,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:35:51,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:35:51,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:35:51,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:35:51,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:35:51,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:35:51,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:35:51,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:35:51,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:35:51,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:35:51,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:35:51,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:35:51,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:35:51,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:35:51,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:35:51,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:35:51,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:35:51,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:35:51,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:35:51,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:35:51,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:35:51,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:35:51,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:35:51,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:35:51,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:35:51,992 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:35:51,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:35:51,993 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:35:51,994 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:35:51,994 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:35:51,995 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:35:51,995 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:35:51,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:35:51,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:35:51,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:35:51,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:35:51,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:35:51,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:35:51,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:35:51,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:35:51,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:35:51,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:35:51,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:35:51,999 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:35:51,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:35:52,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:35:52,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:35:52,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:35:52,000 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:35:52,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:35:52,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:35:52,001 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:35:52,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:35:52,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:35:52,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:35:52,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:35:52,077 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:35:52,078 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.11.cil-2.c [2019-09-10 03:35:52,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b45f7d10/b100ca0b3131487b815e00e4da94cb64/FLAG265c3a1cd [2019-09-10 03:35:52,619 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:35:52,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.11.cil-2.c [2019-09-10 03:35:52,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b45f7d10/b100ca0b3131487b815e00e4da94cb64/FLAG265c3a1cd [2019-09-10 03:35:52,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b45f7d10/b100ca0b3131487b815e00e4da94cb64 [2019-09-10 03:35:53,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:35:53,007 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:35:53,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:35:53,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:35:53,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:35:53,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:35:52" (1/1) ... [2019-09-10 03:35:53,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd675f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53, skipping insertion in model container [2019-09-10 03:35:53,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:35:52" (1/1) ... [2019-09-10 03:35:53,023 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:35:53,079 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:35:53,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:35:53,515 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:35:53,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:35:53,672 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:35:53,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53 WrapperNode [2019-09-10 03:35:53,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:35:53,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:35:53,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:35:53,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:35:53,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... [2019-09-10 03:35:53,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:35:53,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:35:53,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:35:53,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:35:53,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:35:53,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:35:53,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:35:53,845 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:35:53,845 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:35:53,845 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:35:53,846 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:35:53,846 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:35:53,846 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:35:53,846 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:35:53,846 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:35:53,847 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:35:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:35:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:35:53,850 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:35:53,850 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:35:53,851 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:35:53,851 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:35:53,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:35:53,853 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:35:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:35:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:35:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:35:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:35:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:35:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:35:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:35:53,856 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:35:53,856 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:35:53,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:35:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:35:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:35:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:35:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:35:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:35:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:35:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:35:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:35:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:35:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:35:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:35:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:35:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:35:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:35:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:35:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:35:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:35:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:35:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:35:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:35:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:35:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:35:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:35:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:35:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:35:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:35:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:35:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:35:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:35:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:35:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:35:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:35:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:35:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:35:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:35:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:35:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:35:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:35:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:35:53,866 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:35:53,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:35:53,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:35:53,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:35:55,202 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:35:55,202 INFO L283 CfgBuilder]: Removed 14 assume(true) statements. [2019-09-10 03:35:55,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:35:55 BoogieIcfgContainer [2019-09-10 03:35:55,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:35:55,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:35:55,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:35:55,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:35:55,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:35:52" (1/3) ... [2019-09-10 03:35:55,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d10ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:35:55, skipping insertion in model container [2019-09-10 03:35:55,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:35:53" (2/3) ... [2019-09-10 03:35:55,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d10ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:35:55, skipping insertion in model container [2019-09-10 03:35:55,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:35:55" (3/3) ... [2019-09-10 03:35:55,211 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.11.cil-2.c [2019-09-10 03:35:55,221 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:35:55,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:35:55,247 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:35:55,273 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:35:55,274 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:35:55,274 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:35:55,274 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:35:55,274 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:35:55,275 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:35:55,275 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:35:55,275 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:35:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states. [2019-09-10 03:35:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:35:55,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:55,339 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] [2019-09-10 03:35:55,341 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1969298701, now seen corresponding path program 1 times [2019-09-10 03:35:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:55,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:55,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:55,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:35:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:35:55,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:55,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:35:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:35:55,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:35:55,916 INFO L87 Difference]: Start difference. First operand 444 states. Second operand 4 states. [2019-09-10 03:35:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:56,372 INFO L93 Difference]: Finished difference Result 442 states and 643 transitions. [2019-09-10 03:35:56,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:35:56,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:35:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:56,404 INFO L225 Difference]: With dead ends: 442 [2019-09-10 03:35:56,404 INFO L226 Difference]: Without dead ends: 435 [2019-09-10 03:35:56,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:35:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-10 03:35:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-09-10 03:35:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:35:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 636 transitions. [2019-09-10 03:35:56,524 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 636 transitions. Word has length 217 [2019-09-10 03:35:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:56,525 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 636 transitions. [2019-09-10 03:35:56,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:35:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 636 transitions. [2019-09-10 03:35:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:35:56,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:56,532 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] [2019-09-10 03:35:56,532 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1493775, now seen corresponding path program 1 times [2019-09-10 03:35:56,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:56,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:35:56,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:56,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:35:56,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:56,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:35:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:35:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:35:56,775 INFO L87 Difference]: Start difference. First operand 435 states and 636 transitions. Second operand 4 states. [2019-09-10 03:35:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:57,089 INFO L93 Difference]: Finished difference Result 435 states and 635 transitions. [2019-09-10 03:35:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:35:57,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:35:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:57,094 INFO L225 Difference]: With dead ends: 435 [2019-09-10 03:35:57,095 INFO L226 Difference]: Without dead ends: 435 [2019-09-10 03:35:57,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:35:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-10 03:35:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-09-10 03:35:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:35:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 635 transitions. [2019-09-10 03:35:57,119 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 635 transitions. Word has length 217 [2019-09-10 03:35:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:57,119 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 635 transitions. [2019-09-10 03:35:57,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:35:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 635 transitions. [2019-09-10 03:35:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:35:57,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:57,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:35:57,125 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2079089903, now seen corresponding path program 1 times [2019-09-10 03:35:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:57,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:35:57,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:57,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:57,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:57,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:57,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:57,358 INFO L87 Difference]: Start difference. First operand 435 states and 635 transitions. Second operand 5 states. [2019-09-10 03:35:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:58,394 INFO L93 Difference]: Finished difference Result 501 states and 757 transitions. [2019-09-10 03:35:58,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:35:58,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:35:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:58,398 INFO L225 Difference]: With dead ends: 501 [2019-09-10 03:35:58,398 INFO L226 Difference]: Without dead ends: 501 [2019-09-10 03:35:58,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:35:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-10 03:35:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 435. [2019-09-10 03:35:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:35:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 634 transitions. [2019-09-10 03:35:58,416 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 634 transitions. Word has length 217 [2019-09-10 03:35:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:58,417 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 634 transitions. [2019-09-10 03:35:58,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:35:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 634 transitions. [2019-09-10 03:35:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:35:58,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:58,421 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] [2019-09-10 03:35:58,421 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1831121709, now seen corresponding path program 1 times [2019-09-10 03:35:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:58,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:35:58,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:58,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:58,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:58,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:58,551 INFO L87 Difference]: Start difference. First operand 435 states and 634 transitions. Second operand 5 states. [2019-09-10 03:35:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:59,447 INFO L93 Difference]: Finished difference Result 501 states and 757 transitions. [2019-09-10 03:35:59,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:35:59,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:35:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:59,451 INFO L225 Difference]: With dead ends: 501 [2019-09-10 03:35:59,452 INFO L226 Difference]: Without dead ends: 501 [2019-09-10 03:35:59,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:35:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-10 03:35:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 435. [2019-09-10 03:35:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:35:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 633 transitions. [2019-09-10 03:35:59,468 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 633 transitions. Word has length 217 [2019-09-10 03:35:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:59,468 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 633 transitions. [2019-09-10 03:35:59,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:35:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2019-09-10 03:35:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:35:59,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:59,472 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] [2019-09-10 03:35:59,472 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1823122735, now seen corresponding path program 1 times [2019-09-10 03:35:59,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:59,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:59,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:59,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:35:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:35:59,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:35:59,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:59,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:35:59,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:35:59,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:35:59,657 INFO L87 Difference]: Start difference. First operand 435 states and 633 transitions. Second operand 5 states. [2019-09-10 03:36:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:00,779 INFO L93 Difference]: Finished difference Result 499 states and 752 transitions. [2019-09-10 03:36:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:00,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:00,785 INFO L225 Difference]: With dead ends: 499 [2019-09-10 03:36:00,785 INFO L226 Difference]: Without dead ends: 499 [2019-09-10 03:36:00,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-10 03:36:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 435. [2019-09-10 03:36:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 632 transitions. [2019-09-10 03:36:00,813 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 632 transitions. Word has length 217 [2019-09-10 03:36:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:00,814 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 632 transitions. [2019-09-10 03:36:00,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 632 transitions. [2019-09-10 03:36:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:00,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:00,819 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] [2019-09-10 03:36:00,819 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash -948081939, now seen corresponding path program 1 times [2019-09-10 03:36:00,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:00,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:00,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:01,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:01,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:01,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:01,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:01,004 INFO L87 Difference]: Start difference. First operand 435 states and 632 transitions. Second operand 5 states. [2019-09-10 03:36:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:01,868 INFO L93 Difference]: Finished difference Result 497 states and 747 transitions. [2019-09-10 03:36:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:01,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:01,873 INFO L225 Difference]: With dead ends: 497 [2019-09-10 03:36:01,873 INFO L226 Difference]: Without dead ends: 497 [2019-09-10 03:36:01,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-10 03:36:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 435. [2019-09-10 03:36:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 631 transitions. [2019-09-10 03:36:01,894 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 631 transitions. Word has length 217 [2019-09-10 03:36:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:01,894 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 631 transitions. [2019-09-10 03:36:01,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 631 transitions. [2019-09-10 03:36:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:01,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:01,899 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] [2019-09-10 03:36:01,899 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash 209450351, now seen corresponding path program 1 times [2019-09-10 03:36:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:01,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:01,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:01,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:01,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:02,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:02,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:02,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:02,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:02,023 INFO L87 Difference]: Start difference. First operand 435 states and 631 transitions. Second operand 5 states. [2019-09-10 03:36:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:02,894 INFO L93 Difference]: Finished difference Result 495 states and 742 transitions. [2019-09-10 03:36:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:02,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:02,899 INFO L225 Difference]: With dead ends: 495 [2019-09-10 03:36:02,899 INFO L226 Difference]: Without dead ends: 495 [2019-09-10 03:36:02,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-10 03:36:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 435. [2019-09-10 03:36:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 630 transitions. [2019-09-10 03:36:02,918 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 630 transitions. Word has length 217 [2019-09-10 03:36:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:02,919 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 630 transitions. [2019-09-10 03:36:02,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 630 transitions. [2019-09-10 03:36:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:02,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:02,921 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] [2019-09-10 03:36:02,922 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1138683219, now seen corresponding path program 1 times [2019-09-10 03:36:02,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:02,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:03,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:03,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:03,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:03,050 INFO L87 Difference]: Start difference. First operand 435 states and 630 transitions. Second operand 5 states. [2019-09-10 03:36:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:03,939 INFO L93 Difference]: Finished difference Result 493 states and 737 transitions. [2019-09-10 03:36:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:03,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:03,943 INFO L225 Difference]: With dead ends: 493 [2019-09-10 03:36:03,943 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 03:36:03,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 03:36:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 435. [2019-09-10 03:36:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 629 transitions. [2019-09-10 03:36:03,957 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 629 transitions. Word has length 217 [2019-09-10 03:36:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:03,957 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 629 transitions. [2019-09-10 03:36:03,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 629 transitions. [2019-09-10 03:36:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:03,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:03,959 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] [2019-09-10 03:36:03,959 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash 618943919, now seen corresponding path program 1 times [2019-09-10 03:36:03,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:03,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:03,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:04,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:04,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:04,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:04,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:04,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:04,070 INFO L87 Difference]: Start difference. First operand 435 states and 629 transitions. Second operand 5 states. [2019-09-10 03:36:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:04,878 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2019-09-10 03:36:04,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:04,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:04,882 INFO L225 Difference]: With dead ends: 489 [2019-09-10 03:36:04,882 INFO L226 Difference]: Without dead ends: 489 [2019-09-10 03:36:04,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-10 03:36:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 435. [2019-09-10 03:36:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 628 transitions. [2019-09-10 03:36:04,896 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 628 transitions. Word has length 217 [2019-09-10 03:36:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:04,897 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 628 transitions. [2019-09-10 03:36:04,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 628 transitions. [2019-09-10 03:36:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:04,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:04,899 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] [2019-09-10 03:36:04,899 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:04,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:04,900 INFO L82 PathProgramCache]: Analyzing trace with hash -197103311, now seen corresponding path program 1 times [2019-09-10 03:36:04,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:04,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:04,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:05,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:05,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:05,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:05,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:05,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:05,066 INFO L87 Difference]: Start difference. First operand 435 states and 628 transitions. Second operand 5 states. [2019-09-10 03:36:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:05,944 INFO L93 Difference]: Finished difference Result 487 states and 723 transitions. [2019-09-10 03:36:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:05,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:05,948 INFO L225 Difference]: With dead ends: 487 [2019-09-10 03:36:05,949 INFO L226 Difference]: Without dead ends: 487 [2019-09-10 03:36:05,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-10 03:36:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 435. [2019-09-10 03:36:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 627 transitions. [2019-09-10 03:36:05,976 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 627 transitions. Word has length 217 [2019-09-10 03:36:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:05,977 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 627 transitions. [2019-09-10 03:36:05,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 627 transitions. [2019-09-10 03:36:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:05,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:05,981 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] [2019-09-10 03:36:05,981 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2131877231, now seen corresponding path program 1 times [2019-09-10 03:36:05,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:05,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:05,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:05,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:06,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:06,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:06,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:06,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:06,166 INFO L87 Difference]: Start difference. First operand 435 states and 627 transitions. Second operand 5 states. [2019-09-10 03:36:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:07,154 INFO L93 Difference]: Finished difference Result 485 states and 718 transitions. [2019-09-10 03:36:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:07,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:07,157 INFO L225 Difference]: With dead ends: 485 [2019-09-10 03:36:07,157 INFO L226 Difference]: Without dead ends: 485 [2019-09-10 03:36:07,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-10 03:36:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 435. [2019-09-10 03:36:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 626 transitions. [2019-09-10 03:36:07,170 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 626 transitions. Word has length 217 [2019-09-10 03:36:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:07,171 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 626 transitions. [2019-09-10 03:36:07,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 626 transitions. [2019-09-10 03:36:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:07,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:07,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:36:07,173 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash -563941007, now seen corresponding path program 1 times [2019-09-10 03:36:07,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:07,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:07,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:07,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:07,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:07,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:07,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:07,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:07,283 INFO L87 Difference]: Start difference. First operand 435 states and 626 transitions. Second operand 5 states. [2019-09-10 03:36:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:08,102 INFO L93 Difference]: Finished difference Result 483 states and 713 transitions. [2019-09-10 03:36:08,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:08,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:08,111 INFO L225 Difference]: With dead ends: 483 [2019-09-10 03:36:08,112 INFO L226 Difference]: Without dead ends: 483 [2019-09-10 03:36:08,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-10 03:36:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 435. [2019-09-10 03:36:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 625 transitions. [2019-09-10 03:36:08,132 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 625 transitions. Word has length 217 [2019-09-10 03:36:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:08,133 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 625 transitions. [2019-09-10 03:36:08,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 625 transitions. [2019-09-10 03:36:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:08,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:08,136 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] [2019-09-10 03:36:08,136 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash 41833775, now seen corresponding path program 1 times [2019-09-10 03:36:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:08,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:08,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:08,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:08,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:08,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:08,265 INFO L87 Difference]: Start difference. First operand 435 states and 625 transitions. Second operand 5 states. [2019-09-10 03:36:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:09,155 INFO L93 Difference]: Finished difference Result 481 states and 708 transitions. [2019-09-10 03:36:09,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:09,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:09,159 INFO L225 Difference]: With dead ends: 481 [2019-09-10 03:36:09,159 INFO L226 Difference]: Without dead ends: 481 [2019-09-10 03:36:09,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-10 03:36:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 435. [2019-09-10 03:36:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 624 transitions. [2019-09-10 03:36:09,171 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 624 transitions. Word has length 217 [2019-09-10 03:36:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:09,171 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 624 transitions. [2019-09-10 03:36:09,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 624 transitions. [2019-09-10 03:36:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:09,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:09,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:36:09,174 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash 61374897, now seen corresponding path program 1 times [2019-09-10 03:36:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:09,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:09,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:09,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:09,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:09,281 INFO L87 Difference]: Start difference. First operand 435 states and 624 transitions. Second operand 5 states. [2019-09-10 03:36:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:10,120 INFO L93 Difference]: Finished difference Result 525 states and 789 transitions. [2019-09-10 03:36:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:10,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:10,125 INFO L225 Difference]: With dead ends: 525 [2019-09-10 03:36:10,126 INFO L226 Difference]: Without dead ends: 525 [2019-09-10 03:36:10,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-10 03:36:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 435. [2019-09-10 03:36:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 623 transitions. [2019-09-10 03:36:10,146 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 623 transitions. Word has length 217 [2019-09-10 03:36:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:10,147 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 623 transitions. [2019-09-10 03:36:10,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 623 transitions. [2019-09-10 03:36:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:10,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:10,149 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] [2019-09-10 03:36:10,150 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash -769278737, now seen corresponding path program 1 times [2019-09-10 03:36:10,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:10,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:10,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:10,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:10,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:10,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:10,331 INFO L87 Difference]: Start difference. First operand 435 states and 623 transitions. Second operand 5 states. [2019-09-10 03:36:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:11,207 INFO L93 Difference]: Finished difference Result 519 states and 779 transitions. [2019-09-10 03:36:11,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:11,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:11,215 INFO L225 Difference]: With dead ends: 519 [2019-09-10 03:36:11,215 INFO L226 Difference]: Without dead ends: 519 [2019-09-10 03:36:11,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-10 03:36:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 435. [2019-09-10 03:36:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 622 transitions. [2019-09-10 03:36:11,244 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 622 transitions. Word has length 217 [2019-09-10 03:36:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:11,245 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 622 transitions. [2019-09-10 03:36:11,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 622 transitions. [2019-09-10 03:36:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:11,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:11,248 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] [2019-09-10 03:36:11,249 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -241884687, now seen corresponding path program 1 times [2019-09-10 03:36:11,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:11,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:11,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:11,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:11,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:11,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:11,429 INFO L87 Difference]: Start difference. First operand 435 states and 622 transitions. Second operand 5 states. [2019-09-10 03:36:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:12,578 INFO L93 Difference]: Finished difference Result 519 states and 775 transitions. [2019-09-10 03:36:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:12,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:12,582 INFO L225 Difference]: With dead ends: 519 [2019-09-10 03:36:12,582 INFO L226 Difference]: Without dead ends: 519 [2019-09-10 03:36:12,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-10 03:36:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 435. [2019-09-10 03:36:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 621 transitions. [2019-09-10 03:36:12,601 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 621 transitions. Word has length 217 [2019-09-10 03:36:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:12,602 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 621 transitions. [2019-09-10 03:36:12,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 621 transitions. [2019-09-10 03:36:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:12,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:12,604 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] [2019-09-10 03:36:12,604 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 406708083, now seen corresponding path program 1 times [2019-09-10 03:36:12,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:12,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:12,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:12,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:12,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:12,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:12,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:12,750 INFO L87 Difference]: Start difference. First operand 435 states and 621 transitions. Second operand 5 states. [2019-09-10 03:36:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:13,625 INFO L93 Difference]: Finished difference Result 517 states and 770 transitions. [2019-09-10 03:36:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:13,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:13,630 INFO L225 Difference]: With dead ends: 517 [2019-09-10 03:36:13,630 INFO L226 Difference]: Without dead ends: 517 [2019-09-10 03:36:13,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-10 03:36:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 435. [2019-09-10 03:36:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 620 transitions. [2019-09-10 03:36:13,655 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 620 transitions. Word has length 217 [2019-09-10 03:36:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:13,656 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 620 transitions. [2019-09-10 03:36:13,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 620 transitions. [2019-09-10 03:36:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:13,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:13,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] [2019-09-10 03:36:13,659 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1096390223, now seen corresponding path program 1 times [2019-09-10 03:36:13,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:13,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:13,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:13,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:13,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:13,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:13,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:13,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:13,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:13,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:13,820 INFO L87 Difference]: Start difference. First operand 435 states and 620 transitions. Second operand 5 states. [2019-09-10 03:36:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:14,707 INFO L93 Difference]: Finished difference Result 515 states and 765 transitions. [2019-09-10 03:36:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:14,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:14,711 INFO L225 Difference]: With dead ends: 515 [2019-09-10 03:36:14,712 INFO L226 Difference]: Without dead ends: 515 [2019-09-10 03:36:14,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-10 03:36:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 435. [2019-09-10 03:36:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 619 transitions. [2019-09-10 03:36:14,729 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 619 transitions. Word has length 217 [2019-09-10 03:36:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:14,729 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 619 transitions. [2019-09-10 03:36:14,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 619 transitions. [2019-09-10 03:36:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:14,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:14,731 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] [2019-09-10 03:36:14,732 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1006329933, now seen corresponding path program 1 times [2019-09-10 03:36:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:14,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:14,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:14,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:14,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:14,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:14,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:14,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:14,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:14,839 INFO L87 Difference]: Start difference. First operand 435 states and 619 transitions. Second operand 5 states. [2019-09-10 03:36:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:15,961 INFO L93 Difference]: Finished difference Result 513 states and 760 transitions. [2019-09-10 03:36:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:15,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:15,965 INFO L225 Difference]: With dead ends: 513 [2019-09-10 03:36:15,965 INFO L226 Difference]: Without dead ends: 513 [2019-09-10 03:36:15,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-10 03:36:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 435. [2019-09-10 03:36:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 618 transitions. [2019-09-10 03:36:15,978 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 618 transitions. Word has length 217 [2019-09-10 03:36:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:15,978 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 618 transitions. [2019-09-10 03:36:15,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 618 transitions. [2019-09-10 03:36:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:15,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:15,980 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] [2019-09-10 03:36:15,981 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1696161423, now seen corresponding path program 1 times [2019-09-10 03:36:15,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:15,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:15,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:15,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:15,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:16,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:16,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:16,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:16,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:16,078 INFO L87 Difference]: Start difference. First operand 435 states and 618 transitions. Second operand 5 states. [2019-09-10 03:36:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:16,920 INFO L93 Difference]: Finished difference Result 511 states and 755 transitions. [2019-09-10 03:36:16,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:16,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:16,923 INFO L225 Difference]: With dead ends: 511 [2019-09-10 03:36:16,924 INFO L226 Difference]: Without dead ends: 511 [2019-09-10 03:36:16,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-10 03:36:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 435. [2019-09-10 03:36:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 617 transitions. [2019-09-10 03:36:16,960 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 617 transitions. Word has length 217 [2019-09-10 03:36:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:16,963 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 617 transitions. [2019-09-10 03:36:16,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 617 transitions. [2019-09-10 03:36:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:16,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:16,967 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] [2019-09-10 03:36:16,967 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1191079923, now seen corresponding path program 1 times [2019-09-10 03:36:16,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:16,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:16,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:17,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:17,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:17,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:17,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:17,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:17,121 INFO L87 Difference]: Start difference. First operand 435 states and 617 transitions. Second operand 5 states. [2019-09-10 03:36:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:18,045 INFO L93 Difference]: Finished difference Result 509 states and 750 transitions. [2019-09-10 03:36:18,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:18,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:18,048 INFO L225 Difference]: With dead ends: 509 [2019-09-10 03:36:18,048 INFO L226 Difference]: Without dead ends: 509 [2019-09-10 03:36:18,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-10 03:36:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 435. [2019-09-10 03:36:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 616 transitions. [2019-09-10 03:36:18,060 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 616 transitions. Word has length 217 [2019-09-10 03:36:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:18,060 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 616 transitions. [2019-09-10 03:36:18,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 616 transitions. [2019-09-10 03:36:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:18,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:18,062 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] [2019-09-10 03:36:18,062 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1699858737, now seen corresponding path program 1 times [2019-09-10 03:36:18,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:18,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:18,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:18,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:18,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:18,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:18,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:18,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:18,162 INFO L87 Difference]: Start difference. First operand 435 states and 616 transitions. Second operand 5 states. [2019-09-10 03:36:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:19,013 INFO L93 Difference]: Finished difference Result 507 states and 745 transitions. [2019-09-10 03:36:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:19,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:19,019 INFO L225 Difference]: With dead ends: 507 [2019-09-10 03:36:19,019 INFO L226 Difference]: Without dead ends: 507 [2019-09-10 03:36:19,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-10 03:36:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 435. [2019-09-10 03:36:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 615 transitions. [2019-09-10 03:36:19,031 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 615 transitions. Word has length 217 [2019-09-10 03:36:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:19,032 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 615 transitions. [2019-09-10 03:36:19,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 615 transitions. [2019-09-10 03:36:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:19,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:19,034 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] [2019-09-10 03:36:19,034 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash -223391693, now seen corresponding path program 1 times [2019-09-10 03:36:19,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:19,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:19,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:19,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:19,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:19,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:19,131 INFO L87 Difference]: Start difference. First operand 435 states and 615 transitions. Second operand 5 states. [2019-09-10 03:36:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:19,989 INFO L93 Difference]: Finished difference Result 503 states and 736 transitions. [2019-09-10 03:36:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:19,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:19,992 INFO L225 Difference]: With dead ends: 503 [2019-09-10 03:36:19,993 INFO L226 Difference]: Without dead ends: 503 [2019-09-10 03:36:19,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-10 03:36:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 435. [2019-09-10 03:36:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 03:36:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 614 transitions. [2019-09-10 03:36:20,007 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 614 transitions. Word has length 217 [2019-09-10 03:36:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,007 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 614 transitions. [2019-09-10 03:36:20,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 614 transitions. [2019-09-10 03:36:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:20,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,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] [2019-09-10 03:36:20,010 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash 275165109, now seen corresponding path program 1 times [2019-09-10 03:36:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:20,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,135 INFO L87 Difference]: Start difference. First operand 435 states and 614 transitions. Second operand 6 states. [2019-09-10 03:36:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,172 INFO L93 Difference]: Finished difference Result 475 states and 679 transitions. [2019-09-10 03:36:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,174 INFO L225 Difference]: With dead ends: 475 [2019-09-10 03:36:20,175 INFO L226 Difference]: Without dead ends: 475 [2019-09-10 03:36:20,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-10 03:36:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 440. [2019-09-10 03:36:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-10 03:36:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 619 transitions. [2019-09-10 03:36:20,189 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 619 transitions. Word has length 217 [2019-09-10 03:36:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,189 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 619 transitions. [2019-09-10 03:36:20,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 619 transitions. [2019-09-10 03:36:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:20,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,191 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] [2019-09-10 03:36:20,191 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -648002317, now seen corresponding path program 1 times [2019-09-10 03:36:20,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,269 INFO L87 Difference]: Start difference. First operand 440 states and 619 transitions. Second operand 6 states. [2019-09-10 03:36:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,298 INFO L93 Difference]: Finished difference Result 477 states and 679 transitions. [2019-09-10 03:36:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,301 INFO L225 Difference]: With dead ends: 477 [2019-09-10 03:36:20,301 INFO L226 Difference]: Without dead ends: 477 [2019-09-10 03:36:20,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-10 03:36:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 445. [2019-09-10 03:36:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-10 03:36:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 624 transitions. [2019-09-10 03:36:20,313 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 624 transitions. Word has length 217 [2019-09-10 03:36:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,314 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 624 transitions. [2019-09-10 03:36:20,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 624 transitions. [2019-09-10 03:36:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:20,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,315 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] [2019-09-10 03:36:20,316 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,316 INFO L82 PathProgramCache]: Analyzing trace with hash -803982859, now seen corresponding path program 1 times [2019-09-10 03:36:20,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:20,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,394 INFO L87 Difference]: Start difference. First operand 445 states and 624 transitions. Second operand 6 states. [2019-09-10 03:36:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,423 INFO L93 Difference]: Finished difference Result 479 states and 679 transitions. [2019-09-10 03:36:20,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,427 INFO L225 Difference]: With dead ends: 479 [2019-09-10 03:36:20,427 INFO L226 Difference]: Without dead ends: 479 [2019-09-10 03:36:20,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-10 03:36:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 450. [2019-09-10 03:36:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-10 03:36:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 629 transitions. [2019-09-10 03:36:20,439 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 629 transitions. Word has length 217 [2019-09-10 03:36:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,439 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 629 transitions. [2019-09-10 03:36:20,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 629 transitions. [2019-09-10 03:36:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:20,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,442 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] [2019-09-10 03:36:20,442 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -515163469, now seen corresponding path program 1 times [2019-09-10 03:36:20,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:20,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,527 INFO L87 Difference]: Start difference. First operand 450 states and 629 transitions. Second operand 6 states. [2019-09-10 03:36:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,555 INFO L93 Difference]: Finished difference Result 481 states and 679 transitions. [2019-09-10 03:36:20,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,558 INFO L225 Difference]: With dead ends: 481 [2019-09-10 03:36:20,558 INFO L226 Difference]: Without dead ends: 481 [2019-09-10 03:36:20,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-10 03:36:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 455. [2019-09-10 03:36:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-10 03:36:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 634 transitions. [2019-09-10 03:36:20,568 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 634 transitions. Word has length 217 [2019-09-10 03:36:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,568 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 634 transitions. [2019-09-10 03:36:20,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 634 transitions. [2019-09-10 03:36:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:20,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,570 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] [2019-09-10 03:36:20,571 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 346670133, now seen corresponding path program 1 times [2019-09-10 03:36:20,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:20,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:20,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:20,655 INFO L87 Difference]: Start difference. First operand 455 states and 634 transitions. Second operand 6 states. [2019-09-10 03:36:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:20,683 INFO L93 Difference]: Finished difference Result 483 states and 679 transitions. [2019-09-10 03:36:20,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:20,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:20,685 INFO L225 Difference]: With dead ends: 483 [2019-09-10 03:36:20,686 INFO L226 Difference]: Without dead ends: 483 [2019-09-10 03:36:20,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-10 03:36:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 460. [2019-09-10 03:36:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-10 03:36:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 639 transitions. [2019-09-10 03:36:20,696 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 639 transitions. Word has length 217 [2019-09-10 03:36:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:20,696 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 639 transitions. [2019-09-10 03:36:20,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 639 transitions. [2019-09-10 03:36:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:20,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:20,698 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] [2019-09-10 03:36:20,698 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1946410893, now seen corresponding path program 1 times [2019-09-10 03:36:20,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:20,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:20,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:20,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:20,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:20,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:20,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:20,805 INFO L87 Difference]: Start difference. First operand 460 states and 639 transitions. Second operand 4 states. [2019-09-10 03:36:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:21,189 INFO L93 Difference]: Finished difference Result 883 states and 1222 transitions. [2019-09-10 03:36:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:21,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:36:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:21,196 INFO L225 Difference]: With dead ends: 883 [2019-09-10 03:36:21,196 INFO L226 Difference]: Without dead ends: 883 [2019-09-10 03:36:21,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-10 03:36:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 878. [2019-09-10 03:36:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-09-10 03:36:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1218 transitions. [2019-09-10 03:36:21,220 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1218 transitions. Word has length 217 [2019-09-10 03:36:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:21,221 INFO L475 AbstractCegarLoop]: Abstraction has 878 states and 1218 transitions. [2019-09-10 03:36:21,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1218 transitions. [2019-09-10 03:36:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:21,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:21,223 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] [2019-09-10 03:36:21,223 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1221331468, now seen corresponding path program 1 times [2019-09-10 03:36:21,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:21,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:36:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:21,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:21,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:21,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:21,328 INFO L87 Difference]: Start difference. First operand 878 states and 1218 transitions. Second operand 6 states. [2019-09-10 03:36:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:21,359 INFO L93 Difference]: Finished difference Result 903 states and 1256 transitions. [2019-09-10 03:36:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:21,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:21,363 INFO L225 Difference]: With dead ends: 903 [2019-09-10 03:36:21,364 INFO L226 Difference]: Without dead ends: 903 [2019-09-10 03:36:21,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-10 03:36:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 883. [2019-09-10 03:36:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-09-10 03:36:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1222 transitions. [2019-09-10 03:36:21,383 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1222 transitions. Word has length 217 [2019-09-10 03:36:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:21,383 INFO L475 AbstractCegarLoop]: Abstraction has 883 states and 1222 transitions. [2019-09-10 03:36:21,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1222 transitions. [2019-09-10 03:36:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:21,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:21,385 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] [2019-09-10 03:36:21,386 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1102889994, now seen corresponding path program 1 times [2019-09-10 03:36:21,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:21,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:21,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:21,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:21,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:21,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:21,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:21,470 INFO L87 Difference]: Start difference. First operand 883 states and 1222 transitions. Second operand 4 states. [2019-09-10 03:36:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:21,802 INFO L93 Difference]: Finished difference Result 1723 states and 2378 transitions. [2019-09-10 03:36:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:21,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:36:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:21,812 INFO L225 Difference]: With dead ends: 1723 [2019-09-10 03:36:21,812 INFO L226 Difference]: Without dead ends: 1723 [2019-09-10 03:36:21,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-09-10 03:36:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1716. [2019-09-10 03:36:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-09-10 03:36:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2372 transitions. [2019-09-10 03:36:21,862 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2372 transitions. Word has length 217 [2019-09-10 03:36:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:21,864 INFO L475 AbstractCegarLoop]: Abstraction has 1716 states and 2372 transitions. [2019-09-10 03:36:21,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2372 transitions. [2019-09-10 03:36:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:21,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:21,866 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] [2019-09-10 03:36:21,867 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:21,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1327104341, now seen corresponding path program 1 times [2019-09-10 03:36:21,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:21,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:21,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:21,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:21,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:21,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:21,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:21,969 INFO L87 Difference]: Start difference. First operand 1716 states and 2372 transitions. Second operand 6 states. [2019-09-10 03:36:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:22,004 INFO L93 Difference]: Finished difference Result 1760 states and 2438 transitions. [2019-09-10 03:36:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:22,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:22,014 INFO L225 Difference]: With dead ends: 1760 [2019-09-10 03:36:22,014 INFO L226 Difference]: Without dead ends: 1760 [2019-09-10 03:36:22,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-09-10 03:36:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1726. [2019-09-10 03:36:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-09-10 03:36:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2380 transitions. [2019-09-10 03:36:22,057 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2380 transitions. Word has length 217 [2019-09-10 03:36:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:22,058 INFO L475 AbstractCegarLoop]: Abstraction has 1726 states and 2380 transitions. [2019-09-10 03:36:22,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2380 transitions. [2019-09-10 03:36:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:22,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:22,060 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] [2019-09-10 03:36:22,060 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:22,061 INFO L82 PathProgramCache]: Analyzing trace with hash 270373139, now seen corresponding path program 1 times [2019-09-10 03:36:22,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:22,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:22,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:22,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:22,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:22,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:22,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:22,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:22,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:22,180 INFO L87 Difference]: Start difference. First operand 1726 states and 2380 transitions. Second operand 4 states. [2019-09-10 03:36:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:22,583 INFO L93 Difference]: Finished difference Result 3397 states and 4676 transitions. [2019-09-10 03:36:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:22,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:36:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:22,599 INFO L225 Difference]: With dead ends: 3397 [2019-09-10 03:36:22,599 INFO L226 Difference]: Without dead ends: 3397 [2019-09-10 03:36:22,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2019-09-10 03:36:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3386. [2019-09-10 03:36:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-09-10 03:36:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4666 transitions. [2019-09-10 03:36:22,670 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4666 transitions. Word has length 217 [2019-09-10 03:36:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:22,671 INFO L475 AbstractCegarLoop]: Abstraction has 3386 states and 4666 transitions. [2019-09-10 03:36:22,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4666 transitions. [2019-09-10 03:36:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:22,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:22,672 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] [2019-09-10 03:36:22,673 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1387558100, now seen corresponding path program 1 times [2019-09-10 03:36:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:22,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:36:22,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:22,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:22,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:22,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:22,819 INFO L87 Difference]: Start difference. First operand 3386 states and 4666 transitions. Second operand 6 states. [2019-09-10 03:36:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:22,857 INFO L93 Difference]: Finished difference Result 3462 states and 4778 transitions. [2019-09-10 03:36:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:22,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:22,883 INFO L225 Difference]: With dead ends: 3462 [2019-09-10 03:36:22,884 INFO L226 Difference]: Without dead ends: 3462 [2019-09-10 03:36:22,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2019-09-10 03:36:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3406. [2019-09-10 03:36:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3406 states. [2019-09-10 03:36:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4682 transitions. [2019-09-10 03:36:22,961 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4682 transitions. Word has length 217 [2019-09-10 03:36:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:22,962 INFO L475 AbstractCegarLoop]: Abstraction has 3406 states and 4682 transitions. [2019-09-10 03:36:22,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4682 transitions. [2019-09-10 03:36:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:22,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:22,963 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] [2019-09-10 03:36:22,964 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 801281878, now seen corresponding path program 1 times [2019-09-10 03:36:22,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:22,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:23,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:23,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:23,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:23,055 INFO L87 Difference]: Start difference. First operand 3406 states and 4682 transitions. Second operand 6 states. [2019-09-10 03:36:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:23,092 INFO L93 Difference]: Finished difference Result 3534 states and 4875 transitions. [2019-09-10 03:36:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:23,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:23,104 INFO L225 Difference]: With dead ends: 3534 [2019-09-10 03:36:23,104 INFO L226 Difference]: Without dead ends: 3534 [2019-09-10 03:36:23,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2019-09-10 03:36:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 3446. [2019-09-10 03:36:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2019-09-10 03:36:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4722 transitions. [2019-09-10 03:36:23,199 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4722 transitions. Word has length 217 [2019-09-10 03:36:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:23,199 INFO L475 AbstractCegarLoop]: Abstraction has 3446 states and 4722 transitions. [2019-09-10 03:36:23,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4722 transitions. [2019-09-10 03:36:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:23,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:23,202 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] [2019-09-10 03:36:23,202 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1640315540, now seen corresponding path program 1 times [2019-09-10 03:36:23,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:23,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:23,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:23,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:23,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:23,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:23,285 INFO L87 Difference]: Start difference. First operand 3446 states and 4722 transitions. Second operand 6 states. [2019-09-10 03:36:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:23,323 INFO L93 Difference]: Finished difference Result 3550 states and 4875 transitions. [2019-09-10 03:36:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:23,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:23,335 INFO L225 Difference]: With dead ends: 3550 [2019-09-10 03:36:23,335 INFO L226 Difference]: Without dead ends: 3550 [2019-09-10 03:36:23,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2019-09-10 03:36:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3486. [2019-09-10 03:36:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-09-10 03:36:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4762 transitions. [2019-09-10 03:36:23,416 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4762 transitions. Word has length 217 [2019-09-10 03:36:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:23,416 INFO L475 AbstractCegarLoop]: Abstraction has 3486 states and 4762 transitions. [2019-09-10 03:36:23,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4762 transitions. [2019-09-10 03:36:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:23,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:23,418 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] [2019-09-10 03:36:23,418 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1147689366, now seen corresponding path program 1 times [2019-09-10 03:36:23,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:23,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:23,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:23,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:23,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:23,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:23,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:23,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:23,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:23,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:23,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:23,509 INFO L87 Difference]: Start difference. First operand 3486 states and 4762 transitions. Second operand 4 states. [2019-09-10 03:36:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:23,886 INFO L93 Difference]: Finished difference Result 6893 states and 9410 transitions. [2019-09-10 03:36:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:23,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:36:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:23,920 INFO L225 Difference]: With dead ends: 6893 [2019-09-10 03:36:23,921 INFO L226 Difference]: Without dead ends: 6893 [2019-09-10 03:36:23,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2019-09-10 03:36:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 6874. [2019-09-10 03:36:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-09-10 03:36:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 9392 transitions. [2019-09-10 03:36:24,054 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 9392 transitions. Word has length 217 [2019-09-10 03:36:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:24,055 INFO L475 AbstractCegarLoop]: Abstraction has 6874 states and 9392 transitions. [2019-09-10 03:36:24,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 9392 transitions. [2019-09-10 03:36:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:24,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:24,057 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] [2019-09-10 03:36:24,058 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -30285195, now seen corresponding path program 1 times [2019-09-10 03:36:24,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:24,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:24,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:24,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:24,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:24,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:24,203 INFO L87 Difference]: Start difference. First operand 6874 states and 9392 transitions. Second operand 6 states. [2019-09-10 03:36:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:24,270 INFO L93 Difference]: Finished difference Result 6954 states and 9496 transitions. [2019-09-10 03:36:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:24,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:24,392 INFO L225 Difference]: With dead ends: 6954 [2019-09-10 03:36:24,393 INFO L226 Difference]: Without dead ends: 6954 [2019-09-10 03:36:24,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6954 states. [2019-09-10 03:36:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6954 to 6914. [2019-09-10 03:36:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6914 states. [2019-09-10 03:36:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6914 states to 6914 states and 9424 transitions. [2019-09-10 03:36:24,516 INFO L78 Accepts]: Start accepts. Automaton has 6914 states and 9424 transitions. Word has length 217 [2019-09-10 03:36:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:24,517 INFO L475 AbstractCegarLoop]: Abstraction has 6914 states and 9424 transitions. [2019-09-10 03:36:24,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states and 9424 transitions. [2019-09-10 03:36:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:24,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:24,519 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] [2019-09-10 03:36:24,519 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash 171538739, now seen corresponding path program 1 times [2019-09-10 03:36:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:24,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:24,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:24,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:24,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:36:24,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:24,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:36:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:36:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:24,624 INFO L87 Difference]: Start difference. First operand 6914 states and 9424 transitions. Second operand 4 states. [2019-09-10 03:36:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:25,049 INFO L93 Difference]: Finished difference Result 13701 states and 18692 transitions. [2019-09-10 03:36:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:36:25,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 03:36:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:25,094 INFO L225 Difference]: With dead ends: 13701 [2019-09-10 03:36:25,094 INFO L226 Difference]: Without dead ends: 13701 [2019-09-10 03:36:25,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:36:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13701 states. [2019-09-10 03:36:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13701 to 13666. [2019-09-10 03:36:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13666 states. [2019-09-10 03:36:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13666 states to 13666 states and 18658 transitions. [2019-09-10 03:36:25,371 INFO L78 Accepts]: Start accepts. Automaton has 13666 states and 18658 transitions. Word has length 217 [2019-09-10 03:36:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:25,371 INFO L475 AbstractCegarLoop]: Abstraction has 13666 states and 18658 transitions. [2019-09-10 03:36:25,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:36:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13666 states and 18658 transitions. [2019-09-10 03:36:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:25,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:25,373 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] [2019-09-10 03:36:25,374 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:25,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash 411806068, now seen corresponding path program 1 times [2019-09-10 03:36:25,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:25,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:25,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:25,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:25,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:36:25,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:25,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:36:25,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:36:25,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:25,471 INFO L87 Difference]: Start difference. First operand 13666 states and 18658 transitions. Second operand 6 states. [2019-09-10 03:36:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:25,549 INFO L93 Difference]: Finished difference Result 13778 states and 18786 transitions. [2019-09-10 03:36:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:25,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:36:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:25,591 INFO L225 Difference]: With dead ends: 13778 [2019-09-10 03:36:25,591 INFO L226 Difference]: Without dead ends: 13778 [2019-09-10 03:36:25,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2019-09-10 03:36:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13746. [2019-09-10 03:36:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-09-10 03:36:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 18722 transitions. [2019-09-10 03:36:25,856 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 18722 transitions. Word has length 217 [2019-09-10 03:36:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:25,856 INFO L475 AbstractCegarLoop]: Abstraction has 13746 states and 18722 transitions. [2019-09-10 03:36:25,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:36:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 18722 transitions. [2019-09-10 03:36:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:25,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:25,858 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] [2019-09-10 03:36:25,858 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1616780042, now seen corresponding path program 1 times [2019-09-10 03:36:25,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:25,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:25,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:26,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:26,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:26,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:26,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:26,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:26,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:26,503 INFO L87 Difference]: Start difference. First operand 13746 states and 18722 transitions. Second operand 5 states. [2019-09-10 03:36:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:27,683 INFO L93 Difference]: Finished difference Result 20434 states and 27413 transitions. [2019-09-10 03:36:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:27,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:27,733 INFO L225 Difference]: With dead ends: 20434 [2019-09-10 03:36:27,733 INFO L226 Difference]: Without dead ends: 20434 [2019-09-10 03:36:27,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20434 states. [2019-09-10 03:36:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20434 to 19122. [2019-09-10 03:36:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-09-10 03:36:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 24866 transitions. [2019-09-10 03:36:28,092 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 24866 transitions. Word has length 217 [2019-09-10 03:36:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:28,093 INFO L475 AbstractCegarLoop]: Abstraction has 19122 states and 24866 transitions. [2019-09-10 03:36:28,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 24866 transitions. [2019-09-10 03:36:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:28,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:28,095 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] [2019-09-10 03:36:28,095 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:28,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1969868424, now seen corresponding path program 1 times [2019-09-10 03:36:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:28,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:28,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:28,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:28,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:28,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:28,187 INFO L87 Difference]: Start difference. First operand 19122 states and 24866 transitions. Second operand 5 states. [2019-09-10 03:36:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:29,028 INFO L93 Difference]: Finished difference Result 19122 states and 24802 transitions. [2019-09-10 03:36:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:29,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:29,070 INFO L225 Difference]: With dead ends: 19122 [2019-09-10 03:36:29,071 INFO L226 Difference]: Without dead ends: 19122 [2019-09-10 03:36:29,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19122 states. [2019-09-10 03:36:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19122 to 19122. [2019-09-10 03:36:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-09-10 03:36:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 24802 transitions. [2019-09-10 03:36:29,498 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 24802 transitions. Word has length 217 [2019-09-10 03:36:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:29,499 INFO L475 AbstractCegarLoop]: Abstraction has 19122 states and 24802 transitions. [2019-09-10 03:36:29,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 24802 transitions. [2019-09-10 03:36:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:29,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:29,501 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] [2019-09-10 03:36:29,501 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -41595722, now seen corresponding path program 1 times [2019-09-10 03:36:29,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:29,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:29,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:29,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:29,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:29,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:29,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:29,610 INFO L87 Difference]: Start difference. First operand 19122 states and 24802 transitions. Second operand 5 states. [2019-09-10 03:36:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:30,446 INFO L93 Difference]: Finished difference Result 19122 states and 24738 transitions. [2019-09-10 03:36:30,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:30,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:30,491 INFO L225 Difference]: With dead ends: 19122 [2019-09-10 03:36:30,492 INFO L226 Difference]: Without dead ends: 19122 [2019-09-10 03:36:30,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19122 states. [2019-09-10 03:36:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19122 to 19122. [2019-09-10 03:36:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-09-10 03:36:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 24738 transitions. [2019-09-10 03:36:30,788 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 24738 transitions. Word has length 217 [2019-09-10 03:36:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:30,788 INFO L475 AbstractCegarLoop]: Abstraction has 19122 states and 24738 transitions. [2019-09-10 03:36:30,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 24738 transitions. [2019-09-10 03:36:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:30,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:30,790 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] [2019-09-10 03:36:30,790 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash 851890616, now seen corresponding path program 1 times [2019-09-10 03:36:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:30,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:30,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:30,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:30,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:30,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:30,895 INFO L87 Difference]: Start difference. First operand 19122 states and 24738 transitions. Second operand 5 states. [2019-09-10 03:36:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:31,844 INFO L93 Difference]: Finished difference Result 19122 states and 24674 transitions. [2019-09-10 03:36:31,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:31,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:31,883 INFO L225 Difference]: With dead ends: 19122 [2019-09-10 03:36:31,883 INFO L226 Difference]: Without dead ends: 19122 [2019-09-10 03:36:31,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19122 states. [2019-09-10 03:36:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19122 to 19122. [2019-09-10 03:36:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-09-10 03:36:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 24674 transitions. [2019-09-10 03:36:32,209 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 24674 transitions. Word has length 217 [2019-09-10 03:36:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:32,210 INFO L475 AbstractCegarLoop]: Abstraction has 19122 states and 24674 transitions. [2019-09-10 03:36:32,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 24674 transitions. [2019-09-10 03:36:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:32,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:32,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:36:32,212 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash -45502662, now seen corresponding path program 1 times [2019-09-10 03:36:32,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:32,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:32,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:32,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:32,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:32,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:32,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:32,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:32,323 INFO L87 Difference]: Start difference. First operand 19122 states and 24674 transitions. Second operand 5 states. [2019-09-10 03:36:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:33,147 INFO L93 Difference]: Finished difference Result 19122 states and 24610 transitions. [2019-09-10 03:36:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:33,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:33,189 INFO L225 Difference]: With dead ends: 19122 [2019-09-10 03:36:33,189 INFO L226 Difference]: Without dead ends: 19122 [2019-09-10 03:36:33,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19122 states. [2019-09-10 03:36:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19122 to 19122. [2019-09-10 03:36:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-09-10 03:36:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 24610 transitions. [2019-09-10 03:36:33,474 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 24610 transitions. Word has length 217 [2019-09-10 03:36:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:33,474 INFO L475 AbstractCegarLoop]: Abstraction has 19122 states and 24610 transitions. [2019-09-10 03:36:33,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 24610 transitions. [2019-09-10 03:36:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:33,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:33,476 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] [2019-09-10 03:36:33,476 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash 202643832, now seen corresponding path program 1 times [2019-09-10 03:36:33,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:33,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:33,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:33,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:33,574 INFO L87 Difference]: Start difference. First operand 19122 states and 24610 transitions. Second operand 5 states. [2019-09-10 03:36:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:34,770 INFO L93 Difference]: Finished difference Result 26580 states and 34139 transitions. [2019-09-10 03:36:34,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:34,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:34,835 INFO L225 Difference]: With dead ends: 26580 [2019-09-10 03:36:34,836 INFO L226 Difference]: Without dead ends: 26580 [2019-09-10 03:36:34,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26580 states. [2019-09-10 03:36:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26580 to 26004. [2019-09-10 03:36:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2019-09-10 03:36:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 32968 transitions. [2019-09-10 03:36:35,254 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 32968 transitions. Word has length 217 [2019-09-10 03:36:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:35,255 INFO L475 AbstractCegarLoop]: Abstraction has 26004 states and 32968 transitions. [2019-09-10 03:36:35,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 32968 transitions. [2019-09-10 03:36:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:35,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:35,259 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] [2019-09-10 03:36:35,259 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 626290554, now seen corresponding path program 1 times [2019-09-10 03:36:35,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:35,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:35,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:35,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:35,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:35,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:35,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:35,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:35,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:35,383 INFO L87 Difference]: Start difference. First operand 26004 states and 32968 transitions. Second operand 5 states. [2019-09-10 03:36:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:36,217 INFO L93 Difference]: Finished difference Result 26004 states and 32872 transitions. [2019-09-10 03:36:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:36,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:36,275 INFO L225 Difference]: With dead ends: 26004 [2019-09-10 03:36:36,275 INFO L226 Difference]: Without dead ends: 26004 [2019-09-10 03:36:36,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26004 states. [2019-09-10 03:36:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26004 to 26004. [2019-09-10 03:36:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2019-09-10 03:36:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 32872 transitions. [2019-09-10 03:36:36,666 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 32872 transitions. Word has length 217 [2019-09-10 03:36:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:36,666 INFO L475 AbstractCegarLoop]: Abstraction has 26004 states and 32872 transitions. [2019-09-10 03:36:36,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 32872 transitions. [2019-09-10 03:36:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:36,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:36,669 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] [2019-09-10 03:36:36,669 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -745516744, now seen corresponding path program 1 times [2019-09-10 03:36:36,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:36,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:36,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:37,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:37,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:37,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:37,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:37,001 INFO L87 Difference]: Start difference. First operand 26004 states and 32872 transitions. Second operand 5 states. [2019-09-10 03:36:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:37,812 INFO L93 Difference]: Finished difference Result 26004 states and 32776 transitions. [2019-09-10 03:36:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:37,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:37,856 INFO L225 Difference]: With dead ends: 26004 [2019-09-10 03:36:37,856 INFO L226 Difference]: Without dead ends: 26004 [2019-09-10 03:36:37,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26004 states. [2019-09-10 03:36:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26004 to 26004. [2019-09-10 03:36:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2019-09-10 03:36:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 32776 transitions. [2019-09-10 03:36:38,228 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 32776 transitions. Word has length 217 [2019-09-10 03:36:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:38,229 INFO L475 AbstractCegarLoop]: Abstraction has 26004 states and 32776 transitions. [2019-09-10 03:36:38,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 32776 transitions. [2019-09-10 03:36:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:38,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:38,235 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] [2019-09-10 03:36:38,235 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1704083386, now seen corresponding path program 1 times [2019-09-10 03:36:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:38,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:38,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:38,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:38,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:38,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:38,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:38,350 INFO L87 Difference]: Start difference. First operand 26004 states and 32776 transitions. Second operand 5 states. [2019-09-10 03:36:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:39,142 INFO L93 Difference]: Finished difference Result 26004 states and 32680 transitions. [2019-09-10 03:36:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:39,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:39,187 INFO L225 Difference]: With dead ends: 26004 [2019-09-10 03:36:39,188 INFO L226 Difference]: Without dead ends: 26004 [2019-09-10 03:36:39,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26004 states. [2019-09-10 03:36:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26004 to 26004. [2019-09-10 03:36:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2019-09-10 03:36:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 32680 transitions. [2019-09-10 03:36:39,662 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 32680 transitions. Word has length 217 [2019-09-10 03:36:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:39,662 INFO L475 AbstractCegarLoop]: Abstraction has 26004 states and 32680 transitions. [2019-09-10 03:36:39,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 32680 transitions. [2019-09-10 03:36:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:39,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:39,664 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] [2019-09-10 03:36:39,664 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 674724088, now seen corresponding path program 1 times [2019-09-10 03:36:39,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:39,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:39,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:39,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:39,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:39,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:39,774 INFO L87 Difference]: Start difference. First operand 26004 states and 32680 transitions. Second operand 5 states. [2019-09-10 03:36:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:40,548 INFO L93 Difference]: Finished difference Result 26004 states and 32584 transitions. [2019-09-10 03:36:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:40,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:40,587 INFO L225 Difference]: With dead ends: 26004 [2019-09-10 03:36:40,587 INFO L226 Difference]: Without dead ends: 26004 [2019-09-10 03:36:40,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26004 states. [2019-09-10 03:36:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26004 to 26004. [2019-09-10 03:36:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2019-09-10 03:36:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 32584 transitions. [2019-09-10 03:36:40,846 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 32584 transitions. Word has length 217 [2019-09-10 03:36:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:40,846 INFO L475 AbstractCegarLoop]: Abstraction has 26004 states and 32584 transitions. [2019-09-10 03:36:40,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 32584 transitions. [2019-09-10 03:36:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:40,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:40,848 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] [2019-09-10 03:36:40,848 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1334255610, now seen corresponding path program 1 times [2019-09-10 03:36:40,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:40,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:40,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:40,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:40,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:40,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:40,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:40,934 INFO L87 Difference]: Start difference. First operand 26004 states and 32584 transitions. Second operand 5 states. [2019-09-10 03:36:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:42,283 INFO L93 Difference]: Finished difference Result 31892 states and 40156 transitions. [2019-09-10 03:36:42,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:42,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:42,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:42,360 INFO L225 Difference]: With dead ends: 31892 [2019-09-10 03:36:42,360 INFO L226 Difference]: Without dead ends: 31892 [2019-09-10 03:36:42,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31892 states. [2019-09-10 03:36:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31892 to 28372. [2019-09-10 03:36:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28372 states. [2019-09-10 03:36:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28372 states to 28372 states and 35112 transitions. [2019-09-10 03:36:43,517 INFO L78 Accepts]: Start accepts. Automaton has 28372 states and 35112 transitions. Word has length 217 [2019-09-10 03:36:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:43,517 INFO L475 AbstractCegarLoop]: Abstraction has 28372 states and 35112 transitions. [2019-09-10 03:36:43,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28372 states and 35112 transitions. [2019-09-10 03:36:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:43,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:43,520 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] [2019-09-10 03:36:43,520 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash 490250108, now seen corresponding path program 1 times [2019-09-10 03:36:43,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:43,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:43,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:43,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:43,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:43,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:43,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:43,608 INFO L87 Difference]: Start difference. First operand 28372 states and 35112 transitions. Second operand 5 states. [2019-09-10 03:36:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:44,910 INFO L93 Difference]: Finished difference Result 39588 states and 49841 transitions. [2019-09-10 03:36:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:44,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:44,979 INFO L225 Difference]: With dead ends: 39588 [2019-09-10 03:36:44,979 INFO L226 Difference]: Without dead ends: 39588 [2019-09-10 03:36:44,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39588 states. [2019-09-10 03:36:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39588 to 33124. [2019-09-10 03:36:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33124 states. [2019-09-10 03:36:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 40376 transitions. [2019-09-10 03:36:45,352 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 40376 transitions. Word has length 217 [2019-09-10 03:36:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:45,353 INFO L475 AbstractCegarLoop]: Abstraction has 33124 states and 40376 transitions. [2019-09-10 03:36:45,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 40376 transitions. [2019-09-10 03:36:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:45,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:45,354 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] [2019-09-10 03:36:45,355 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1753733190, now seen corresponding path program 1 times [2019-09-10 03:36:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:45,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:45,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:45,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:45,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:45,471 INFO L87 Difference]: Start difference. First operand 33124 states and 40376 transitions. Second operand 5 states. [2019-09-10 03:36:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:47,016 INFO L93 Difference]: Finished difference Result 55130 states and 68184 transitions. [2019-09-10 03:36:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:36:47,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:47,125 INFO L225 Difference]: With dead ends: 55130 [2019-09-10 03:36:47,126 INFO L226 Difference]: Without dead ends: 55130 [2019-09-10 03:36:47,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:36:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55130 states. [2019-09-10 03:36:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55130 to 45112. [2019-09-10 03:36:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-09-10 03:36:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 54584 transitions. [2019-09-10 03:36:47,622 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 54584 transitions. Word has length 217 [2019-09-10 03:36:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:47,623 INFO L475 AbstractCegarLoop]: Abstraction has 45112 states and 54584 transitions. [2019-09-10 03:36:47,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 54584 transitions. [2019-09-10 03:36:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:36:47,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:47,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:36:47,625 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1243799581, now seen corresponding path program 1 times [2019-09-10 03:36:47,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:47,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:47,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:47,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:47,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:47,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:47,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:47,714 INFO L87 Difference]: Start difference. First operand 45112 states and 54584 transitions. Second operand 5 states. [2019-09-10 03:36:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:48,670 INFO L93 Difference]: Finished difference Result 39668 states and 49633 transitions. [2019-09-10 03:36:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:36:48,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 03:36:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:48,746 INFO L225 Difference]: With dead ends: 39668 [2019-09-10 03:36:48,746 INFO L226 Difference]: Without dead ends: 39668 [2019-09-10 03:36:48,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:36:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39668 states. [2019-09-10 03:36:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39668 to 37556. [2019-09-10 03:36:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37556 states. [2019-09-10 03:36:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37556 states to 37556 states and 45128 transitions. [2019-09-10 03:36:49,133 INFO L78 Accepts]: Start accepts. Automaton has 37556 states and 45128 transitions. Word has length 218 [2019-09-10 03:36:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:49,133 INFO L475 AbstractCegarLoop]: Abstraction has 37556 states and 45128 transitions. [2019-09-10 03:36:49,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37556 states and 45128 transitions. [2019-09-10 03:36:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:49,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:49,135 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] [2019-09-10 03:36:49,135 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1826119748, now seen corresponding path program 1 times [2019-09-10 03:36:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:49,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:49,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:49,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:36:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:49,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:49,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:49,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:49,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:49,544 INFO L87 Difference]: Start difference. First operand 37556 states and 45128 transitions. Second operand 5 states. [2019-09-10 03:36:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:50,897 INFO L93 Difference]: Finished difference Result 47300 states and 57969 transitions. [2019-09-10 03:36:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:50,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:50,981 INFO L225 Difference]: With dead ends: 47300 [2019-09-10 03:36:50,981 INFO L226 Difference]: Without dead ends: 47300 [2019-09-10 03:36:50,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47300 states. [2019-09-10 03:36:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47300 to 41668. [2019-09-10 03:36:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41668 states. [2019-09-10 03:36:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41668 states to 41668 states and 49496 transitions. [2019-09-10 03:36:51,419 INFO L78 Accepts]: Start accepts. Automaton has 41668 states and 49496 transitions. Word has length 217 [2019-09-10 03:36:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:51,419 INFO L475 AbstractCegarLoop]: Abstraction has 41668 states and 49496 transitions. [2019-09-10 03:36:51,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 41668 states and 49496 transitions. [2019-09-10 03:36:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:51,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:51,422 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] [2019-09-10 03:36:51,422 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1551360134, now seen corresponding path program 1 times [2019-09-10 03:36:51,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:51,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:51,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:51,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:51,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:51,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:51,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:51,527 INFO L87 Difference]: Start difference. First operand 41668 states and 49496 transitions. Second operand 5 states. [2019-09-10 03:36:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:52,866 INFO L93 Difference]: Finished difference Result 50612 states and 61313 transitions. [2019-09-10 03:36:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:52,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:52,949 INFO L225 Difference]: With dead ends: 50612 [2019-09-10 03:36:52,949 INFO L226 Difference]: Without dead ends: 50612 [2019-09-10 03:36:52,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50612 states. [2019-09-10 03:36:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50612 to 45460. [2019-09-10 03:36:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45460 states. [2019-09-10 03:36:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45460 states to 45460 states and 53416 transitions. [2019-09-10 03:36:53,667 INFO L78 Accepts]: Start accepts. Automaton has 45460 states and 53416 transitions. Word has length 217 [2019-09-10 03:36:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:53,667 INFO L475 AbstractCegarLoop]: Abstraction has 45460 states and 53416 transitions. [2019-09-10 03:36:53,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 45460 states and 53416 transitions. [2019-09-10 03:36:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:53,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:53,669 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] [2019-09-10 03:36:53,669 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash -849760260, now seen corresponding path program 1 times [2019-09-10 03:36:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:53,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:53,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:53,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:53,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:53,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:53,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:53,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:53,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:53,767 INFO L87 Difference]: Start difference. First operand 45460 states and 53416 transitions. Second operand 5 states. [2019-09-10 03:36:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:55,211 INFO L93 Difference]: Finished difference Result 51564 states and 62105 transitions. [2019-09-10 03:36:55,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:55,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:55,315 INFO L225 Difference]: With dead ends: 51564 [2019-09-10 03:36:55,316 INFO L226 Difference]: Without dead ends: 51564 [2019-09-10 03:36:55,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51564 states. [2019-09-10 03:36:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51564 to 49436. [2019-09-10 03:36:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49436 states. [2019-09-10 03:36:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49436 states to 49436 states and 57584 transitions. [2019-09-10 03:36:55,831 INFO L78 Accepts]: Start accepts. Automaton has 49436 states and 57584 transitions. Word has length 217 [2019-09-10 03:36:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:55,831 INFO L475 AbstractCegarLoop]: Abstraction has 49436 states and 57584 transitions. [2019-09-10 03:36:55,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 49436 states and 57584 transitions. [2019-09-10 03:36:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:55,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:55,833 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] [2019-09-10 03:36:55,833 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -827128006, now seen corresponding path program 1 times [2019-09-10 03:36:55,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:55,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:55,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:55,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:55,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:55,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:55,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:55,933 INFO L87 Difference]: Start difference. First operand 49436 states and 57584 transitions. Second operand 5 states. [2019-09-10 03:36:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:57,583 INFO L93 Difference]: Finished difference Result 52076 states and 61228 transitions. [2019-09-10 03:36:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:57,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:57,658 INFO L225 Difference]: With dead ends: 52076 [2019-09-10 03:36:57,659 INFO L226 Difference]: Without dead ends: 52076 [2019-09-10 03:36:57,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52076 states. [2019-09-10 03:36:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52076 to 51076. [2019-09-10 03:36:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51076 states. [2019-09-10 03:36:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51076 states to 51076 states and 59088 transitions. [2019-09-10 03:36:58,129 INFO L78 Accepts]: Start accepts. Automaton has 51076 states and 59088 transitions. Word has length 217 [2019-09-10 03:36:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:58,129 INFO L475 AbstractCegarLoop]: Abstraction has 51076 states and 59088 transitions. [2019-09-10 03:36:58,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:36:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 51076 states and 59088 transitions. [2019-09-10 03:36:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:36:58,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:58,131 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] [2019-09-10 03:36:58,131 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 559075388, now seen corresponding path program 1 times [2019-09-10 03:36:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:58,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:36:58,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:36:58,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:36:58,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:58,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:36:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:36:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:36:58,227 INFO L87 Difference]: Start difference. First operand 51076 states and 59088 transitions. Second operand 5 states. [2019-09-10 03:36:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:59,580 INFO L93 Difference]: Finished difference Result 53700 states and 62516 transitions. [2019-09-10 03:36:59,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:36:59,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:36:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:59,677 INFO L225 Difference]: With dead ends: 53700 [2019-09-10 03:36:59,678 INFO L226 Difference]: Without dead ends: 53700 [2019-09-10 03:36:59,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:36:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53700 states. [2019-09-10 03:37:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53700 to 52004. [2019-09-10 03:37:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52004 states. [2019-09-10 03:37:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52004 states to 52004 states and 59600 transitions. [2019-09-10 03:37:00,191 INFO L78 Accepts]: Start accepts. Automaton has 52004 states and 59600 transitions. Word has length 217 [2019-09-10 03:37:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:00,191 INFO L475 AbstractCegarLoop]: Abstraction has 52004 states and 59600 transitions. [2019-09-10 03:37:00,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 52004 states and 59600 transitions. [2019-09-10 03:37:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:37:00,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:00,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:00,193 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:00,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1812663874, now seen corresponding path program 1 times [2019-09-10 03:37:00,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:00,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:00,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:00,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:00,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:00,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:00,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:00,259 INFO L87 Difference]: Start difference. First operand 52004 states and 59600 transitions. Second operand 5 states. [2019-09-10 03:37:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:01,857 INFO L93 Difference]: Finished difference Result 57876 states and 67673 transitions. [2019-09-10 03:37:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:37:01,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:37:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:01,966 INFO L225 Difference]: With dead ends: 57876 [2019-09-10 03:37:01,966 INFO L226 Difference]: Without dead ends: 57876 [2019-09-10 03:37:01,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:37:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57876 states. [2019-09-10 03:37:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57876 to 54836. [2019-09-10 03:37:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54836 states. [2019-09-10 03:37:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54836 states to 54836 states and 62176 transitions. [2019-09-10 03:37:02,549 INFO L78 Accepts]: Start accepts. Automaton has 54836 states and 62176 transitions. Word has length 217 [2019-09-10 03:37:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:02,549 INFO L475 AbstractCegarLoop]: Abstraction has 54836 states and 62176 transitions. [2019-09-10 03:37:02,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54836 states and 62176 transitions. [2019-09-10 03:37:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:37:02,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:02,550 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] [2019-09-10 03:37:02,551 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1750624260, now seen corresponding path program 1 times [2019-09-10 03:37:02,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:02,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:02,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:02,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:02,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:02,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:02,645 INFO L87 Difference]: Start difference. First operand 54836 states and 62176 transitions. Second operand 5 states. [2019-09-10 03:37:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:03,943 INFO L93 Difference]: Finished difference Result 66200 states and 76783 transitions. [2019-09-10 03:37:03,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:37:03,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:37:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:04,063 INFO L225 Difference]: With dead ends: 66200 [2019-09-10 03:37:04,064 INFO L226 Difference]: Without dead ends: 66200 [2019-09-10 03:37:04,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:37:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66200 states. [2019-09-10 03:37:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66200 to 64072. [2019-09-10 03:37:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64072 states. [2019-09-10 03:37:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64072 states to 64072 states and 72198 transitions. [2019-09-10 03:37:04,726 INFO L78 Accepts]: Start accepts. Automaton has 64072 states and 72198 transitions. Word has length 217 [2019-09-10 03:37:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:04,726 INFO L475 AbstractCegarLoop]: Abstraction has 64072 states and 72198 transitions. [2019-09-10 03:37:04,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64072 states and 72198 transitions. [2019-09-10 03:37:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:37:04,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:04,729 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] [2019-09-10 03:37:04,729 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:04,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1610075650, now seen corresponding path program 1 times [2019-09-10 03:37:04,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:04,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:04,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:04,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:04,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:04,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:04,825 INFO L87 Difference]: Start difference. First operand 64072 states and 72198 transitions. Second operand 5 states. [2019-09-10 03:37:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:06,324 INFO L93 Difference]: Finished difference Result 66168 states and 75178 transitions. [2019-09-10 03:37:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:37:06,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 03:37:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:06,443 INFO L225 Difference]: With dead ends: 66168 [2019-09-10 03:37:06,443 INFO L226 Difference]: Without dead ends: 66168 [2019-09-10 03:37:06,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:37:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66168 states. [2019-09-10 03:37:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66168 to 65104. [2019-09-10 03:37:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65104 states. [2019-09-10 03:37:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65104 states to 65104 states and 72782 transitions. [2019-09-10 03:37:07,078 INFO L78 Accepts]: Start accepts. Automaton has 65104 states and 72782 transitions. Word has length 217 [2019-09-10 03:37:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:07,078 INFO L475 AbstractCegarLoop]: Abstraction has 65104 states and 72782 transitions. [2019-09-10 03:37:07,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 65104 states and 72782 transitions. [2019-09-10 03:37:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:37:07,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:07,080 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] [2019-09-10 03:37:07,080 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1744089156, now seen corresponding path program 1 times [2019-09-10 03:37:07,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:07,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:07,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:37:07,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:07,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:37:07,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:07,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:37:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:37:07,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:37:07,180 INFO L87 Difference]: Start difference. First operand 65104 states and 72782 transitions. Second operand 3 states. [2019-09-10 03:37:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:07,536 INFO L93 Difference]: Finished difference Result 129480 states and 146703 transitions. [2019-09-10 03:37:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:37:07,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 03:37:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:07,810 INFO L225 Difference]: With dead ends: 129480 [2019-09-10 03:37:07,810 INFO L226 Difference]: Without dead ends: 129480 [2019-09-10 03:37:07,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:37:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129480 states. [2019-09-10 03:37:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129480 to 129448. [2019-09-10 03:37:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129448 states. [2019-09-10 03:37:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129448 states to 129448 states and 146671 transitions. [2019-09-10 03:37:09,513 INFO L78 Accepts]: Start accepts. Automaton has 129448 states and 146671 transitions. Word has length 217 [2019-09-10 03:37:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:09,513 INFO L475 AbstractCegarLoop]: Abstraction has 129448 states and 146671 transitions. [2019-09-10 03:37:09,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:37:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 129448 states and 146671 transitions. [2019-09-10 03:37:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-10 03:37:09,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:09,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:37:09,557 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash -512977888, now seen corresponding path program 1 times [2019-09-10 03:37:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:09,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-10 03:37:09,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:37:09,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:37:09,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2019-09-10 03:37:09,708 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [277], [282], [285], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [857], [858], [859], [869], [871], [873], [874], [875], [878], [883], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1127], [1129], [1132], [1143], [1145], [1147], [1151], [1159], [1162], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1189], [1192], [1195], [1201], [1204], [1223], [1236], [1249], [1262], [1275], [1288], [1301], [1314], [1327], [1340], [1353], [1359], [1369], [1371], [1373], [1374], [1375], [1385], [1387], [1389], [1390], [1391], [1392], [1406], [1408], [1470], [1471], [1490], [1491], [1492], [1496], [1497], [1498], [1499], [1500], [1501], [1502], [1503], [1504], [1505], [1506], [1507], [1508], [1509], [1510], [1511], [1512], [1513], [1514], [1515], [1516], [1517], [1518], [1519], [1520], [1521], [1524], [1525], [1526], [1528], [1529], [1530], [1531], [1554], [1555], [1556], [1557], [1558], [1559], [1560], [1561], [1562], [1563], [1564], [1584], [1585], [1586] [2019-09-10 03:37:09,753 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:37:09,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:37:10,265 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:37:10,267 INFO L272 AbstractInterpreter]: Visited 226 different actions 337 times. Never merged. Never widened. Performed 2738 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2738 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:37:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:10,271 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:37:11,081 INFO L227 lantSequenceWeakener]: Weakened 345 states. On average, predicates are now at 72.58% of their original sizes. [2019-09-10 03:37:11,081 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:37:31,605 INFO L420 sIntCurrentIteration]: We unified 361 AI predicates to 361 [2019-09-10 03:37:31,605 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:37:31,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:37:31,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [163] imperfect sequences [4] total 165 [2019-09-10 03:37:31,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:31,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-10 03:37:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-10 03:37:31,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2368, Invalid=24038, Unknown=0, NotChecked=0, Total=26406 [2019-09-10 03:37:31,612 INFO L87 Difference]: Start difference. First operand 129448 states and 146671 transitions. Second operand 163 states. [2019-09-10 03:40:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:14,691 INFO L93 Difference]: Finished difference Result 134233 states and 153134 transitions. [2019-09-10 03:40:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-09-10 03:40:14,691 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 362 [2019-09-10 03:40:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:15,039 INFO L225 Difference]: With dead ends: 134233 [2019-09-10 03:40:15,039 INFO L226 Difference]: Without dead ends: 134233 [2019-09-10 03:40:15,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36765 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=9297, Invalid=105285, Unknown=0, NotChecked=0, Total=114582 [2019-09-10 03:40:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134233 states. [2019-09-10 03:40:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134233 to 133630. [2019-09-10 03:40:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133630 states. [2019-09-10 03:40:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133630 states to 133630 states and 152450 transitions. [2019-09-10 03:40:16,538 INFO L78 Accepts]: Start accepts. Automaton has 133630 states and 152450 transitions. Word has length 362 [2019-09-10 03:40:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:16,538 INFO L475 AbstractCegarLoop]: Abstraction has 133630 states and 152450 transitions. [2019-09-10 03:40:16,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-10 03:40:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 133630 states and 152450 transitions. [2019-09-10 03:40:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-10 03:40:16,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:16,593 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:40:16,594 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1693143075, now seen corresponding path program 1 times [2019-09-10 03:40:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:16,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:16,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 03:40:16,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:40:16,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:40:16,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:16,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:40:16,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:40:16,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:40:16,743 INFO L87 Difference]: Start difference. First operand 133630 states and 152450 transitions. Second operand 5 states. [2019-09-10 03:40:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:18,882 INFO L93 Difference]: Finished difference Result 227627 states and 263994 transitions. [2019-09-10 03:40:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:40:18,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 368 [2019-09-10 03:40:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:19,595 INFO L225 Difference]: With dead ends: 227627 [2019-09-10 03:40:19,596 INFO L226 Difference]: Without dead ends: 169811 [2019-09-10 03:40:19,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:40:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169811 states. [2019-09-10 03:40:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169811 to 165523. [2019-09-10 03:40:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165523 states. [2019-09-10 03:40:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165523 states to 165523 states and 189067 transitions. [2019-09-10 03:40:26,384 INFO L78 Accepts]: Start accepts. Automaton has 165523 states and 189067 transitions. Word has length 368 [2019-09-10 03:40:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:26,384 INFO L475 AbstractCegarLoop]: Abstraction has 165523 states and 189067 transitions. [2019-09-10 03:40:26,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:40:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 165523 states and 189067 transitions. [2019-09-10 03:40:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-10 03:40:26,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:26,599 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:40:26,599 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1690352642, now seen corresponding path program 1 times [2019-09-10 03:40:26,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:26,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-10 03:40:26,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:26,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:26,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 524 with the following transitions: [2019-09-10 03:40:26,843 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [39], [41], [43], [44], [277], [282], [285], [288], [293], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [476], [479], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [673], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [800], [803], [857], [858], [859], [869], [871], [873], [874], [875], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1127], [1129], [1132], [1143], [1145], [1147], [1151], [1159], [1162], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1189], [1192], [1195], [1201], [1204], [1210], [1214], [1217], [1223], [1236], [1249], [1262], [1275], [1288], [1301], [1314], [1327], [1340], [1344], [1347], [1359], [1369], [1371], [1373], [1374], [1375], [1385], [1387], [1389], [1390], [1391], [1392], [1406], [1408], [1443], [1445], [1448], [1459], [1461], [1463], [1465], [1469], [1470], [1471], [1490], [1491], [1492], [1496], [1497], [1498], [1499], [1500], [1501], [1502], [1503], [1504], [1505], [1506], [1507], [1508], [1509], [1510], [1511], [1512], [1513], [1514], [1515], [1516], [1517], [1518], [1519], [1520], [1521], [1524], [1525], [1526], [1528], [1529], [1530], [1531], [1532], [1533], [1552], [1553], [1554], [1555], [1556], [1557], [1558], [1559], [1560], [1561], [1562], [1563], [1564], [1584], [1585], [1586], [1588], [1589] [2019-09-10 03:40:26,859 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:26,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:27,076 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:27,077 INFO L272 AbstractInterpreter]: Visited 239 different actions 352 times. Never merged. Never widened. Performed 2886 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2886 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:40:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:27,077 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:27,566 INFO L227 lantSequenceWeakener]: Weakened 365 states. On average, predicates are now at 71.24% of their original sizes. [2019-09-10 03:40:27,567 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:47,751 INFO L420 sIntCurrentIteration]: We unified 522 AI predicates to 522 [2019-09-10 03:40:47,751 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:47,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:47,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [162] imperfect sequences [5] total 165 [2019-09-10 03:40:47,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:47,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-10 03:40:47,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-10 03:40:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2003, Invalid=24079, Unknown=0, NotChecked=0, Total=26082 [2019-09-10 03:40:47,755 INFO L87 Difference]: Start difference. First operand 165523 states and 189067 transitions. Second operand 162 states. [2019-09-10 03:44:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:44:10,931 INFO L93 Difference]: Finished difference Result 166983 states and 190742 transitions. [2019-09-10 03:44:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-09-10 03:44:10,931 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 523 [2019-09-10 03:44:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:44:11,325 INFO L225 Difference]: With dead ends: 166983 [2019-09-10 03:44:11,325 INFO L226 Difference]: Without dead ends: 166983 [2019-09-10 03:44:11,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36719 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=7829, Invalid=108793, Unknown=0, NotChecked=0, Total=116622 [2019-09-10 03:44:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166983 states. [2019-09-10 03:44:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166983 to 166371. [2019-09-10 03:44:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166371 states. [2019-09-10 03:44:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166371 states to 166371 states and 190047 transitions. [2019-09-10 03:44:14,026 INFO L78 Accepts]: Start accepts. Automaton has 166371 states and 190047 transitions. Word has length 523 [2019-09-10 03:44:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:44:14,026 INFO L475 AbstractCegarLoop]: Abstraction has 166371 states and 190047 transitions. [2019-09-10 03:44:14,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-10 03:44:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 166371 states and 190047 transitions. [2019-09-10 03:44:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-10 03:44:14,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:44:14,195 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,195 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:44:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash -672597160, now seen corresponding path program 1 times [2019-09-10 03:44:14,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:44:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:14,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:44:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:14,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:44:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:44:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-09-10 03:44:14,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:44:14,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:44:14,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 525 with the following transitions: [2019-09-10 03:44:14,449 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [76], [92], [94], [102], [277], [282], [285], [288], [293], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [476], [479], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [673], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [800], [803], [857], [858], [859], [869], [871], [873], [874], [875], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1127], [1129], [1132], [1143], [1145], [1147], [1151], [1159], [1162], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1189], [1192], [1195], [1201], [1204], [1210], [1214], [1220], [1223], [1227], [1230], [1236], [1249], [1262], [1275], [1288], [1301], [1314], [1327], [1340], [1344], [1347], [1359], [1369], [1371], [1373], [1374], [1375], [1385], [1387], [1389], [1390], [1391], [1392], [1406], [1408], [1443], [1445], [1448], [1459], [1461], [1463], [1465], [1469], [1470], [1471], [1490], [1491], [1492], [1496], [1497], [1498], [1499], [1500], [1501], [1502], [1503], [1504], [1505], [1506], [1507], [1508], [1509], [1510], [1511], [1512], [1513], [1514], [1515], [1516], [1517], [1518], [1519], [1520], [1521], [1524], [1525], [1526], [1528], [1529], [1530], [1531], [1534], [1535], [1552], [1553], [1554], [1555], [1556], [1557], [1558], [1559], [1560], [1561], [1562], [1563], [1564], [1584], [1585], [1586], [1588], [1589] [2019-09-10 03:44:14,451 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:44:14,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:44:14,601 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:44:14,601 INFO L272 AbstractInterpreter]: Visited 242 different actions 355 times. Never merged. Never widened. Performed 2896 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2896 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:44:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:14,602 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:44:14,908 INFO L227 lantSequenceWeakener]: Weakened 368 states. On average, predicates are now at 71.31% of their original sizes. [2019-09-10 03:44:14,908 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:44:35,583 INFO L420 sIntCurrentIteration]: We unified 523 AI predicates to 523 [2019-09-10 03:44:35,584 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:44:35,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:44:35,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [164] imperfect sequences [4] total 166 [2019-09-10 03:44:35,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:44:35,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-10 03:44:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-10 03:44:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2015, Invalid=24717, Unknown=0, NotChecked=0, Total=26732 [2019-09-10 03:44:35,588 INFO L87 Difference]: Start difference. First operand 166371 states and 190047 transitions. Second operand 164 states. [2019-09-10 03:48:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:25,118 INFO L93 Difference]: Finished difference Result 167844 states and 191744 transitions. [2019-09-10 03:48:25,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2019-09-10 03:48:25,118 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 524 [2019-09-10 03:48:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:25,415 INFO L225 Difference]: With dead ends: 167844 [2019-09-10 03:48:25,415 INFO L226 Difference]: Without dead ends: 167844 [2019-09-10 03:48:25,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37121 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=7891, Invalid=110101, Unknown=0, NotChecked=0, Total=117992 [2019-09-10 03:48:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167844 states. [2019-09-10 03:48:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167844 to 167226. [2019-09-10 03:48:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167226 states. [2019-09-10 03:48:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167226 states to 167226 states and 191041 transitions. [2019-09-10 03:48:27,273 INFO L78 Accepts]: Start accepts. Automaton has 167226 states and 191041 transitions. Word has length 524 [2019-09-10 03:48:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:27,273 INFO L475 AbstractCegarLoop]: Abstraction has 167226 states and 191041 transitions. [2019-09-10 03:48:27,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-09-10 03:48:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 167226 states and 191041 transitions. [2019-09-10 03:48:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-10 03:48:27,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:27,427 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,428 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1246195157, now seen corresponding path program 1 times [2019-09-10 03:48:27,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:27,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:27,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 71 proven. 40 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-10 03:48:27,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:48:27,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:48:27,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 525 with the following transitions: [2019-09-10 03:48:27,644 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [39], [41], [43], [44], [277], [282], [285], [288], [293], [295], [297], [299], [300], [312], [322], [324], [326], [327], [332], [338], [344], [350], [356], [362], [368], [374], [380], [386], [392], [398], [404], [410], [416], [422], [428], [434], [440], [446], [452], [458], [464], [470], [472], [473], [476], [479], [483], [485], [487], [488], [634], [644], [646], [648], [649], [650], [660], [662], [664], [665], [667], [668], [670], [673], [675], [678], [683], [686], [691], [694], [699], [702], [707], [710], [715], [718], [723], [726], [731], [734], [739], [742], [747], [750], [755], [758], [763], [765], [795], [798], [857], [858], [859], [869], [871], [873], [874], [875], [885], [887], [889], [890], [895], [901], [907], [913], [919], [925], [931], [937], [943], [949], [955], [961], [967], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1035], [1038], [1044], [1050], [1056], [1062], [1068], [1074], [1080], [1086], [1092], [1098], [1104], [1108], [1109], [1119], [1121], [1123], [1124], [1127], [1129], [1132], [1143], [1145], [1147], [1151], [1159], [1162], [1163], [1164], [1174], [1176], [1178], [1179], [1180], [1189], [1192], [1195], [1201], [1204], [1207], [1214], [1217], [1223], [1236], [1249], [1262], [1275], [1288], [1301], [1314], [1327], [1340], [1344], [1347], [1359], [1369], [1371], [1373], [1374], [1375], [1385], [1387], [1389], [1390], [1391], [1392], [1406], [1408], [1443], [1445], [1448], [1459], [1461], [1463], [1465], [1469], [1470], [1471], [1490], [1491], [1492], [1496], [1497], [1498], [1499], [1500], [1501], [1502], [1503], [1504], [1505], [1506], [1507], [1508], [1509], [1510], [1511], [1512], [1513], [1514], [1515], [1516], [1517], [1518], [1519], [1520], [1521], [1524], [1525], [1526], [1528], [1529], [1530], [1531], [1532], [1533], [1552], [1553], [1554], [1555], [1556], [1557], [1558], [1559], [1560], [1561], [1562], [1563], [1564], [1584], [1585], [1586], [1588], [1589] [2019-09-10 03:48:27,646 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:48:27,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:48:27,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:48:27,795 INFO L272 AbstractInterpreter]: Visited 238 different actions 361 times. Merged at 4 different actions 4 times. Never widened. Performed 3022 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3022 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 148 variables. [2019-09-10 03:48:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:27,795 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:48:28,428 INFO L227 lantSequenceWeakener]: Weakened 366 states. On average, predicates are now at 71.35% of their original sizes. [2019-09-10 03:48:28,429 INFO L418 sIntCurrentIteration]: Unifying AI predicates