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/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:12:36,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:12:36,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:12:36,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:12:36,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:12:36,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:12:36,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:12:36,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:12:36,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:12:36,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:12:36,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:12:36,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:12:36,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:12:36,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:12:36,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:12:36,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:12:36,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:12:36,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:12:36,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:12:36,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:12:36,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:12:36,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:12:36,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:12:36,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:12:36,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:12:36,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:12:36,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:12:36,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:12:36,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:12:36,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:12:36,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:12:36,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:12:36,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:12:36,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:12:36,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:12:36,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:12:36,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:12:36,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:12:36,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:12:36,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:12:36,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:12:36,950 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 06:12:36,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:12:36,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:12:36,980 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:12:36,982 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:12:36,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:12:36,983 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:12:36,983 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:12:36,984 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:12:36,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:12:36,984 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:12:36,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:12:36,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:12:36,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:12:36,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:12:36,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:12:36,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:12:36,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:12:36,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:12:36,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:12:36,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:12:36,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:12:36,989 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:12:36,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:12:36,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:12:36,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:12:36,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:12:36,990 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:12:36,990 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:12:36,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:12:36,991 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:12:37,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:12:37,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:12:37,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:12:37,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:12:37,066 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:12:37,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:12:37,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853a0e6cf/3c3d7599187243519aac2e5c14bb23be/FLAGb5883bf7a [2019-09-10 06:12:37,735 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:12:37,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:12:37,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853a0e6cf/3c3d7599187243519aac2e5c14bb23be/FLAGb5883bf7a [2019-09-10 06:12:37,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853a0e6cf/3c3d7599187243519aac2e5c14bb23be [2019-09-10 06:12:37,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:12:37,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:12:37,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:37,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:12:37,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:12:37,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:37" (1/1) ... [2019-09-10 06:12:37,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58227a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:37, skipping insertion in model container [2019-09-10 06:12:37,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:37" (1/1) ... [2019-09-10 06:12:37,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:12:38,066 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:12:39,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:39,080 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:12:39,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:39,514 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:12:39,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39 WrapperNode [2019-09-10 06:12:39,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:39,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:12:39,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:12:39,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:12:39,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (1/1) ... [2019-09-10 06:12:39,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:12:39,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:12:39,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:12:39,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:12:39,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (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 06:12:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:12:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:12:39,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:12:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:12:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:12:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:12:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:12:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:12:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:12:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:12:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:12:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:12:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:12:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:12:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:12:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:12:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:12:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:12:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:12:42,015 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:12:42,015 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:12:42,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:42 BoogieIcfgContainer [2019-09-10 06:12:42,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:12:42,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:12:42,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:12:42,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:12:42,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:12:37" (1/3) ... [2019-09-10 06:12:42,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:42, skipping insertion in model container [2019-09-10 06:12:42,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:39" (2/3) ... [2019-09-10 06:12:42,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:42, skipping insertion in model container [2019-09-10 06:12:42,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:42" (3/3) ... [2019-09-10 06:12:42,025 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:12:42,036 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:12:42,045 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:12:42,070 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:12:42,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:12:42,102 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:12:42,102 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:12:42,102 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:12:42,103 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:12:42,103 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:12:42,103 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:12:42,103 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:12:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states. [2019-09-10 06:12:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-10 06:12:42,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:42,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:42,198 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:42,204 INFO L82 PathProgramCache]: Analyzing trace with hash -273867960, now seen corresponding path program 1 times [2019-09-10 06:12:42,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:43,632 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 06:12:43,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:43,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:43,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:43,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:43,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:43,659 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 4 states. [2019-09-10 06:12:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:43,949 INFO L93 Difference]: Finished difference Result 1391 states and 2458 transitions. [2019-09-10 06:12:43,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:43,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-09-10 06:12:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:43,984 INFO L225 Difference]: With dead ends: 1391 [2019-09-10 06:12:43,984 INFO L226 Difference]: Without dead ends: 1383 [2019-09-10 06:12:43,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-09-10 06:12:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2019-09-10 06:12:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2019-09-10 06:12:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2147 transitions. [2019-09-10 06:12:44,127 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2147 transitions. Word has length 296 [2019-09-10 06:12:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:44,129 INFO L475 AbstractCegarLoop]: Abstraction has 1381 states and 2147 transitions. [2019-09-10 06:12:44,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2147 transitions. [2019-09-10 06:12:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 06:12:44,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:44,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:44,142 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1576767261, now seen corresponding path program 1 times [2019-09-10 06:12:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:44,387 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 06:12:44,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:44,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:44,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:44,391 INFO L87 Difference]: Start difference. First operand 1381 states and 2147 transitions. Second operand 3 states. [2019-09-10 06:12:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:44,447 INFO L93 Difference]: Finished difference Result 2742 states and 4259 transitions. [2019-09-10 06:12:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:44,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-10 06:12:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:44,463 INFO L225 Difference]: With dead ends: 2742 [2019-09-10 06:12:44,463 INFO L226 Difference]: Without dead ends: 2742 [2019-09-10 06:12:44,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-09-10 06:12:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1394. [2019-09-10 06:12:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-10 06:12:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2166 transitions. [2019-09-10 06:12:44,514 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2166 transitions. Word has length 298 [2019-09-10 06:12:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:44,514 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2166 transitions. [2019-09-10 06:12:44,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2166 transitions. [2019-09-10 06:12:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 06:12:44,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:44,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:44,522 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash -430171170, now seen corresponding path program 1 times [2019-09-10 06:12:44,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:44,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:44,843 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 06:12:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:44,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:44,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:44,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:44,845 INFO L87 Difference]: Start difference. First operand 1394 states and 2166 transitions. Second operand 3 states. [2019-09-10 06:12:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:44,943 INFO L93 Difference]: Finished difference Result 2727 states and 4216 transitions. [2019-09-10 06:12:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:44,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-10 06:12:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:44,957 INFO L225 Difference]: With dead ends: 2727 [2019-09-10 06:12:44,958 INFO L226 Difference]: Without dead ends: 2727 [2019-09-10 06:12:44,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-09-10 06:12:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2725. [2019-09-10 06:12:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2725 states. [2019-09-10 06:12:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4215 transitions. [2019-09-10 06:12:45,020 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4215 transitions. Word has length 298 [2019-09-10 06:12:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:45,021 INFO L475 AbstractCegarLoop]: Abstraction has 2725 states and 4215 transitions. [2019-09-10 06:12:45,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4215 transitions. [2019-09-10 06:12:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-10 06:12:45,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:45,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:45,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash 683417454, now seen corresponding path program 1 times [2019-09-10 06:12:45,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:45,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:45,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:45,159 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 06:12:45,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:45,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:45,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:45,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:45,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:45,162 INFO L87 Difference]: Start difference. First operand 2725 states and 4215 transitions. Second operand 3 states. [2019-09-10 06:12:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:45,222 INFO L93 Difference]: Finished difference Result 5397 states and 8335 transitions. [2019-09-10 06:12:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:45,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-09-10 06:12:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:45,246 INFO L225 Difference]: With dead ends: 5397 [2019-09-10 06:12:45,247 INFO L226 Difference]: Without dead ends: 5397 [2019-09-10 06:12:45,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2019-09-10 06:12:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 2743. [2019-09-10 06:12:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2019-09-10 06:12:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4236 transitions. [2019-09-10 06:12:45,353 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4236 transitions. Word has length 299 [2019-09-10 06:12:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:45,353 INFO L475 AbstractCegarLoop]: Abstraction has 2743 states and 4236 transitions. [2019-09-10 06:12:45,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4236 transitions. [2019-09-10 06:12:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:12:45,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:45,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:45,369 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash -799745095, now seen corresponding path program 1 times [2019-09-10 06:12:45,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:45,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:45,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:45,798 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 06:12:45,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:45,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:45,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:45,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:45,801 INFO L87 Difference]: Start difference. First operand 2743 states and 4236 transitions. Second operand 3 states. [2019-09-10 06:12:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:45,961 INFO L93 Difference]: Finished difference Result 5288 states and 8105 transitions. [2019-09-10 06:12:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:45,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-10 06:12:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:45,996 INFO L225 Difference]: With dead ends: 5288 [2019-09-10 06:12:45,996 INFO L226 Difference]: Without dead ends: 5288 [2019-09-10 06:12:45,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2019-09-10 06:12:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 5286. [2019-09-10 06:12:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5286 states. [2019-09-10 06:12:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 8104 transitions. [2019-09-10 06:12:46,176 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 8104 transitions. Word has length 300 [2019-09-10 06:12:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:46,176 INFO L475 AbstractCegarLoop]: Abstraction has 5286 states and 8104 transitions. [2019-09-10 06:12:46,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 8104 transitions. [2019-09-10 06:12:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:12:46,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:46,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:46,200 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2079229974, now seen corresponding path program 1 times [2019-09-10 06:12:46,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:46,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:46,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:46,688 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 06:12:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:46,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:46,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:46,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:46,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:46,690 INFO L87 Difference]: Start difference. First operand 5286 states and 8104 transitions. Second operand 4 states. [2019-09-10 06:12:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:46,792 INFO L93 Difference]: Finished difference Result 9634 states and 14673 transitions. [2019-09-10 06:12:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:46,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-10 06:12:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:46,838 INFO L225 Difference]: With dead ends: 9634 [2019-09-10 06:12:46,839 INFO L226 Difference]: Without dead ends: 9634 [2019-09-10 06:12:46,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9634 states. [2019-09-10 06:12:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9634 to 5521. [2019-09-10 06:12:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5521 states. [2019-09-10 06:12:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5521 states to 5521 states and 8492 transitions. [2019-09-10 06:12:47,010 INFO L78 Accepts]: Start accepts. Automaton has 5521 states and 8492 transitions. Word has length 300 [2019-09-10 06:12:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:47,011 INFO L475 AbstractCegarLoop]: Abstraction has 5521 states and 8492 transitions. [2019-09-10 06:12:47,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5521 states and 8492 transitions. [2019-09-10 06:12:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:12:47,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:47,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:47,026 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1219902707, now seen corresponding path program 1 times [2019-09-10 06:12:47,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:47,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:47,173 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 06:12:47,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:47,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:47,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:47,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:47,176 INFO L87 Difference]: Start difference. First operand 5521 states and 8492 transitions. Second operand 3 states. [2019-09-10 06:12:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:47,244 INFO L93 Difference]: Finished difference Result 10275 states and 15628 transitions. [2019-09-10 06:12:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:47,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:12:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:47,274 INFO L225 Difference]: With dead ends: 10275 [2019-09-10 06:12:47,274 INFO L226 Difference]: Without dead ends: 10275 [2019-09-10 06:12:47,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2019-09-10 06:12:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 5625. [2019-09-10 06:12:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5625 states. [2019-09-10 06:12:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 8635 transitions. [2019-09-10 06:12:47,440 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 8635 transitions. Word has length 302 [2019-09-10 06:12:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:47,440 INFO L475 AbstractCegarLoop]: Abstraction has 5625 states and 8635 transitions. [2019-09-10 06:12:47,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 8635 transitions. [2019-09-10 06:12:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-10 06:12:47,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:47,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:47,461 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash 3714028, now seen corresponding path program 1 times [2019-09-10 06:12:47,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:47,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:47,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:47,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:47,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:47,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:47,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:47,741 INFO L87 Difference]: Start difference. First operand 5625 states and 8635 transitions. Second operand 3 states. [2019-09-10 06:12:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:47,830 INFO L93 Difference]: Finished difference Result 10400 states and 15774 transitions. [2019-09-10 06:12:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:47,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-10 06:12:47,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:47,856 INFO L225 Difference]: With dead ends: 10400 [2019-09-10 06:12:47,856 INFO L226 Difference]: Without dead ends: 10400 [2019-09-10 06:12:47,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10400 states. [2019-09-10 06:12:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10400 to 5750. [2019-09-10 06:12:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5750 states. [2019-09-10 06:12:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 8781 transitions. [2019-09-10 06:12:48,010 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 8781 transitions. Word has length 303 [2019-09-10 06:12:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:48,010 INFO L475 AbstractCegarLoop]: Abstraction has 5750 states and 8781 transitions. [2019-09-10 06:12:48,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 8781 transitions. [2019-09-10 06:12:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:12:48,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:48,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:48,025 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash 810921408, now seen corresponding path program 1 times [2019-09-10 06:12:48,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:48,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:48,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:48,448 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 06:12:48,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:48,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:48,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:48,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:48,450 INFO L87 Difference]: Start difference. First operand 5750 states and 8781 transitions. Second operand 4 states. [2019-09-10 06:12:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:48,584 INFO L93 Difference]: Finished difference Result 7350 states and 11174 transitions. [2019-09-10 06:12:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:48,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-10 06:12:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:48,600 INFO L225 Difference]: With dead ends: 7350 [2019-09-10 06:12:48,600 INFO L226 Difference]: Without dead ends: 6598 [2019-09-10 06:12:48,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2019-09-10 06:12:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6596. [2019-09-10 06:12:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6596 states. [2019-09-10 06:12:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 10032 transitions. [2019-09-10 06:12:48,710 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 10032 transitions. Word has length 304 [2019-09-10 06:12:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:48,710 INFO L475 AbstractCegarLoop]: Abstraction has 6596 states and 10032 transitions. [2019-09-10 06:12:48,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 10032 transitions. [2019-09-10 06:12:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:12:48,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:48,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:48,727 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash 584962070, now seen corresponding path program 1 times [2019-09-10 06:12:48,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:48,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:48,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:49,092 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 06:12:49,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:49,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:49,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:49,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:49,098 INFO L87 Difference]: Start difference. First operand 6596 states and 10032 transitions. Second operand 3 states. [2019-09-10 06:12:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:49,265 INFO L93 Difference]: Finished difference Result 12907 states and 19500 transitions. [2019-09-10 06:12:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:49,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:12:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:49,316 INFO L225 Difference]: With dead ends: 12907 [2019-09-10 06:12:49,316 INFO L226 Difference]: Without dead ends: 12907 [2019-09-10 06:12:49,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12907 states. [2019-09-10 06:12:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12907 to 12905. [2019-09-10 06:12:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12905 states. [2019-09-10 06:12:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 19499 transitions. [2019-09-10 06:12:49,576 INFO L78 Accepts]: Start accepts. Automaton has 12905 states and 19499 transitions. Word has length 306 [2019-09-10 06:12:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:49,576 INFO L475 AbstractCegarLoop]: Abstraction has 12905 states and 19499 transitions. [2019-09-10 06:12:49,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12905 states and 19499 transitions. [2019-09-10 06:12:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:12:49,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:49,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:49,605 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1321064755, now seen corresponding path program 1 times [2019-09-10 06:12:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:49,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:49,954 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 06:12:49,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:49,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:49,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:49,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:49,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:49,956 INFO L87 Difference]: Start difference. First operand 12905 states and 19499 transitions. Second operand 4 states. [2019-09-10 06:12:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:50,105 INFO L93 Difference]: Finished difference Result 24700 states and 37183 transitions. [2019-09-10 06:12:50,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:50,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:12:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:50,162 INFO L225 Difference]: With dead ends: 24700 [2019-09-10 06:12:50,163 INFO L226 Difference]: Without dead ends: 24700 [2019-09-10 06:12:50,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-09-10 06:12:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 14084. [2019-09-10 06:12:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-09-10 06:12:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 21484 transitions. [2019-09-10 06:12:50,553 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 21484 transitions. Word has length 306 [2019-09-10 06:12:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:50,554 INFO L475 AbstractCegarLoop]: Abstraction has 14084 states and 21484 transitions. [2019-09-10 06:12:50,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 21484 transitions. [2019-09-10 06:12:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:12:50,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:50,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:50,585 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash -307449274, now seen corresponding path program 1 times [2019-09-10 06:12:50,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:50,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:50,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:50,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:50,766 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 06:12:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:50,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:50,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:50,769 INFO L87 Difference]: Start difference. First operand 14084 states and 21484 transitions. Second operand 3 states. [2019-09-10 06:12:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:50,923 INFO L93 Difference]: Finished difference Result 26923 states and 40746 transitions. [2019-09-10 06:12:50,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:50,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:12:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:51,004 INFO L225 Difference]: With dead ends: 26923 [2019-09-10 06:12:51,004 INFO L226 Difference]: Without dead ends: 26923 [2019-09-10 06:12:51,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26923 states. [2019-09-10 06:12:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26923 to 14354. [2019-09-10 06:12:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14354 states. [2019-09-10 06:12:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14354 states to 14354 states and 21834 transitions. [2019-09-10 06:12:51,427 INFO L78 Accepts]: Start accepts. Automaton has 14354 states and 21834 transitions. Word has length 306 [2019-09-10 06:12:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:51,427 INFO L475 AbstractCegarLoop]: Abstraction has 14354 states and 21834 transitions. [2019-09-10 06:12:51,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 14354 states and 21834 transitions. [2019-09-10 06:12:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:12:51,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:51,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:51,465 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -520567887, now seen corresponding path program 1 times [2019-09-10 06:12:51,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:51,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:51,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:52,186 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 06:12:52,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:52,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:52,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:52,189 INFO L87 Difference]: Start difference. First operand 14354 states and 21834 transitions. Second operand 3 states. [2019-09-10 06:12:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:52,294 INFO L93 Difference]: Finished difference Result 27135 states and 40960 transitions. [2019-09-10 06:12:52,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:52,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-10 06:12:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:52,355 INFO L225 Difference]: With dead ends: 27135 [2019-09-10 06:12:52,355 INFO L226 Difference]: Without dead ends: 27135 [2019-09-10 06:12:52,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27135 states. [2019-09-10 06:12:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27135 to 14646. [2019-09-10 06:12:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14646 states. [2019-09-10 06:12:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14646 states to 14646 states and 22172 transitions. [2019-09-10 06:12:52,667 INFO L78 Accepts]: Start accepts. Automaton has 14646 states and 22172 transitions. Word has length 307 [2019-09-10 06:12:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:52,668 INFO L475 AbstractCegarLoop]: Abstraction has 14646 states and 22172 transitions. [2019-09-10 06:12:52,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 14646 states and 22172 transitions. [2019-09-10 06:12:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:12:52,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:52,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:52,702 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:52,703 INFO L82 PathProgramCache]: Analyzing trace with hash 205458356, now seen corresponding path program 1 times [2019-09-10 06:12:52,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:52,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:52,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:52,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:52,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:52,935 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 06:12:52,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:52,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:52,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:52,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:52,937 INFO L87 Difference]: Start difference. First operand 14646 states and 22172 transitions. Second operand 3 states. [2019-09-10 06:12:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:53,619 INFO L93 Difference]: Finished difference Result 22440 states and 33521 transitions. [2019-09-10 06:12:53,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:53,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:12:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:53,684 INFO L225 Difference]: With dead ends: 22440 [2019-09-10 06:12:53,685 INFO L226 Difference]: Without dead ends: 22440 [2019-09-10 06:12:53,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:12:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22440 states. [2019-09-10 06:12:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22440 to 22438. [2019-09-10 06:12:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22438 states. [2019-09-10 06:12:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22438 states to 22438 states and 33520 transitions. [2019-09-10 06:12:54,041 INFO L78 Accepts]: Start accepts. Automaton has 22438 states and 33520 transitions. Word has length 308 [2019-09-10 06:12:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:54,042 INFO L475 AbstractCegarLoop]: Abstraction has 22438 states and 33520 transitions. [2019-09-10 06:12:54,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22438 states and 33520 transitions. [2019-09-10 06:12:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:12:54,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:54,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:54,088 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:54,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1707348438, now seen corresponding path program 1 times [2019-09-10 06:12:54,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:54,525 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-09-10 06:12:54,705 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 06:12:54,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:54,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:12:54,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:54,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:12:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:12:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:12:54,707 INFO L87 Difference]: Start difference. First operand 22438 states and 33520 transitions. Second operand 8 states. [2019-09-10 06:12:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:55,042 INFO L93 Difference]: Finished difference Result 34064 states and 50849 transitions. [2019-09-10 06:12:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:55,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 308 [2019-09-10 06:12:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:55,113 INFO L225 Difference]: With dead ends: 34064 [2019-09-10 06:12:55,114 INFO L226 Difference]: Without dead ends: 34064 [2019-09-10 06:12:55,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:12:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34064 states. [2019-09-10 06:12:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34064 to 34062. [2019-09-10 06:12:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-09-10 06:12:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 50848 transitions. [2019-09-10 06:12:55,739 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 50848 transitions. Word has length 308 [2019-09-10 06:12:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:55,740 INFO L475 AbstractCegarLoop]: Abstraction has 34062 states and 50848 transitions. [2019-09-10 06:12:55,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:12:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 50848 transitions. [2019-09-10 06:12:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:12:55,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:55,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:55,814 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1900209902, now seen corresponding path program 1 times [2019-09-10 06:12:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:55,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:55,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:56,643 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 06:12:56,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:56,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:56,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:56,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:56,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:56,647 INFO L87 Difference]: Start difference. First operand 34062 states and 50848 transitions. Second operand 4 states. [2019-09-10 06:12:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:56,951 INFO L93 Difference]: Finished difference Result 64610 states and 95598 transitions. [2019-09-10 06:12:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:56,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:12:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:57,083 INFO L225 Difference]: With dead ends: 64610 [2019-09-10 06:12:57,084 INFO L226 Difference]: Without dead ends: 64610 [2019-09-10 06:12:57,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64610 states. [2019-09-10 06:12:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64610 to 64608. [2019-09-10 06:12:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64608 states. [2019-09-10 06:12:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64608 states to 64608 states and 95597 transitions. [2019-09-10 06:12:58,137 INFO L78 Accepts]: Start accepts. Automaton has 64608 states and 95597 transitions. Word has length 308 [2019-09-10 06:12:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:58,138 INFO L475 AbstractCegarLoop]: Abstraction has 64608 states and 95597 transitions. [2019-09-10 06:12:58,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 64608 states and 95597 transitions. [2019-09-10 06:12:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:12:58,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:58,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:58,199 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1669169546, now seen corresponding path program 1 times [2019-09-10 06:12:58,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:59,940 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 06:12:59,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:59,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:59,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:59,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:59,943 INFO L87 Difference]: Start difference. First operand 64608 states and 95597 transitions. Second operand 4 states. [2019-09-10 06:13:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:00,283 INFO L93 Difference]: Finished difference Result 76150 states and 111768 transitions. [2019-09-10 06:13:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:00,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:13:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:00,384 INFO L225 Difference]: With dead ends: 76150 [2019-09-10 06:13:00,384 INFO L226 Difference]: Without dead ends: 70267 [2019-09-10 06:13:00,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70267 states. [2019-09-10 06:13:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70267 to 70265. [2019-09-10 06:13:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70265 states. [2019-09-10 06:13:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70265 states to 70265 states and 103159 transitions. [2019-09-10 06:13:01,450 INFO L78 Accepts]: Start accepts. Automaton has 70265 states and 103159 transitions. Word has length 308 [2019-09-10 06:13:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:01,450 INFO L475 AbstractCegarLoop]: Abstraction has 70265 states and 103159 transitions. [2019-09-10 06:13:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 70265 states and 103159 transitions. [2019-09-10 06:13:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:13:01,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:01,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:01,510 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash -581596335, now seen corresponding path program 1 times [2019-09-10 06:13:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:01,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:01,987 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 06:13:01,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:01,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:01,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:01,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:01,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:01,989 INFO L87 Difference]: Start difference. First operand 70265 states and 103159 transitions. Second operand 4 states. [2019-09-10 06:13:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:02,396 INFO L93 Difference]: Finished difference Result 138019 states and 202412 transitions. [2019-09-10 06:13:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:02,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:13:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:02,594 INFO L225 Difference]: With dead ends: 138019 [2019-09-10 06:13:02,594 INFO L226 Difference]: Without dead ends: 138019 [2019-09-10 06:13:02,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138019 states. [2019-09-10 06:13:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138019 to 75502. [2019-09-10 06:13:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75502 states. [2019-09-10 06:13:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75502 states to 75502 states and 111116 transitions. [2019-09-10 06:13:06,870 INFO L78 Accepts]: Start accepts. Automaton has 75502 states and 111116 transitions. Word has length 308 [2019-09-10 06:13:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:06,871 INFO L475 AbstractCegarLoop]: Abstraction has 75502 states and 111116 transitions. [2019-09-10 06:13:06,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 75502 states and 111116 transitions. [2019-09-10 06:13:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:13:06,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:06,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:06,913 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1006208620, now seen corresponding path program 1 times [2019-09-10 06:13:06,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:06,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:06,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:07,300 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 06:13:07,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:07,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:07,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:07,304 INFO L87 Difference]: Start difference. First operand 75502 states and 111116 transitions. Second operand 4 states. [2019-09-10 06:13:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:07,791 INFO L93 Difference]: Finished difference Result 145147 states and 211366 transitions. [2019-09-10 06:13:07,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:07,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:13:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:07,946 INFO L225 Difference]: With dead ends: 145147 [2019-09-10 06:13:07,946 INFO L226 Difference]: Without dead ends: 145147 [2019-09-10 06:13:07,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145147 states. [2019-09-10 06:13:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145147 to 145145. [2019-09-10 06:13:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145145 states. [2019-09-10 06:13:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145145 states to 145145 states and 211365 transitions. [2019-09-10 06:13:09,551 INFO L78 Accepts]: Start accepts. Automaton has 145145 states and 211365 transitions. Word has length 308 [2019-09-10 06:13:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:09,552 INFO L475 AbstractCegarLoop]: Abstraction has 145145 states and 211365 transitions. [2019-09-10 06:13:09,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 145145 states and 211365 transitions. [2019-09-10 06:13:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:13:09,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:09,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:09,649 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1373768697, now seen corresponding path program 1 times [2019-09-10 06:13:09,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:09,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:09,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:09,840 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 06:13:09,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:09,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:09,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:09,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:09,842 INFO L87 Difference]: Start difference. First operand 145145 states and 211365 transitions. Second operand 3 states. [2019-09-10 06:13:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:10,633 INFO L93 Difference]: Finished difference Result 284717 states and 411443 transitions. [2019-09-10 06:13:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:10,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:13:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:10,915 INFO L225 Difference]: With dead ends: 284717 [2019-09-10 06:13:10,915 INFO L226 Difference]: Without dead ends: 284717 [2019-09-10 06:13:10,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:13:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284717 states. [2019-09-10 06:13:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284717 to 284715. [2019-09-10 06:13:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284715 states. [2019-09-10 06:13:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284715 states to 284715 states and 411442 transitions. [2019-09-10 06:13:16,906 INFO L78 Accepts]: Start accepts. Automaton has 284715 states and 411442 transitions. Word has length 310 [2019-09-10 06:13:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:16,907 INFO L475 AbstractCegarLoop]: Abstraction has 284715 states and 411442 transitions. [2019-09-10 06:13:16,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 284715 states and 411442 transitions. [2019-09-10 06:13:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:13:17,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:17,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:17,089 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 227172606, now seen corresponding path program 1 times [2019-09-10 06:13:17,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:17,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:17,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:17,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:17,212 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 06:13:17,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:17,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:17,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:17,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:17,214 INFO L87 Difference]: Start difference. First operand 284715 states and 411442 transitions. Second operand 3 states. [2019-09-10 06:13:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:18,141 INFO L93 Difference]: Finished difference Result 551842 states and 796292 transitions. [2019-09-10 06:13:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:18,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:13:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:24,519 INFO L225 Difference]: With dead ends: 551842 [2019-09-10 06:13:24,520 INFO L226 Difference]: Without dead ends: 551842 [2019-09-10 06:13:24,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:13:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551842 states. [2019-09-10 06:13:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551842 to 285460. [2019-09-10 06:13:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285460 states. [2019-09-10 06:13:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285460 states to 285460 states and 412256 transitions. [2019-09-10 06:13:29,256 INFO L78 Accepts]: Start accepts. Automaton has 285460 states and 412256 transitions. Word has length 310 [2019-09-10 06:13:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:29,256 INFO L475 AbstractCegarLoop]: Abstraction has 285460 states and 412256 transitions. [2019-09-10 06:13:29,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 285460 states and 412256 transitions. [2019-09-10 06:13:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:13:29,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:29,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:29,433 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1035761893, now seen corresponding path program 1 times [2019-09-10 06:13:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:29,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:29,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:29,559 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 06:13:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:29,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:29,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:29,561 INFO L87 Difference]: Start difference. First operand 285460 states and 412256 transitions. Second operand 3 states. [2019-09-10 06:13:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:32,028 INFO L93 Difference]: Finished difference Result 567200 states and 818272 transitions. [2019-09-10 06:13:32,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:32,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:13:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:32,574 INFO L225 Difference]: With dead ends: 567200 [2019-09-10 06:13:32,574 INFO L226 Difference]: Without dead ends: 567200 [2019-09-10 06:13:32,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:13:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567200 states. [2019-09-10 06:13:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567200 to 286346. [2019-09-10 06:13:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286346 states. [2019-09-10 06:13:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286346 states to 286346 states and 413271 transitions. [2019-09-10 06:13:43,250 INFO L78 Accepts]: Start accepts. Automaton has 286346 states and 413271 transitions. Word has length 311 [2019-09-10 06:13:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:43,250 INFO L475 AbstractCegarLoop]: Abstraction has 286346 states and 413271 transitions. [2019-09-10 06:13:43,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 286346 states and 413271 transitions. [2019-09-10 06:13:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:13:43,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:43,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:43,462 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1797781332, now seen corresponding path program 1 times [2019-09-10 06:13:43,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:43,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:43,680 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 06:13:43,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:43,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:43,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:43,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:43,683 INFO L87 Difference]: Start difference. First operand 286346 states and 413271 transitions. Second operand 3 states. [2019-09-10 06:13:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:45,672 INFO L93 Difference]: Finished difference Result 555731 states and 796083 transitions. [2019-09-10 06:13:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:45,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:13:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:46,327 INFO L225 Difference]: With dead ends: 555731 [2019-09-10 06:13:46,328 INFO L226 Difference]: Without dead ends: 555731 [2019-09-10 06:13:46,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:13:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555731 states. [2019-09-10 06:14:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555731 to 555729. [2019-09-10 06:14:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555729 states. [2019-09-10 06:14:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555729 states to 555729 states and 796082 transitions. [2019-09-10 06:14:02,699 INFO L78 Accepts]: Start accepts. Automaton has 555729 states and 796082 transitions. Word has length 312 [2019-09-10 06:14:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:02,699 INFO L475 AbstractCegarLoop]: Abstraction has 555729 states and 796082 transitions. [2019-09-10 06:14:02,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 555729 states and 796082 transitions. [2019-09-10 06:14:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:14:03,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:03,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:03,119 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash 381789105, now seen corresponding path program 1 times [2019-09-10 06:14:03,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:03,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:03,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 06:14:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:03,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:03,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:03,397 INFO L87 Difference]: Start difference. First operand 555729 states and 796082 transitions. Second operand 4 states. [2019-09-10 06:14:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:12,052 INFO L93 Difference]: Finished difference Result 1010166 states and 1442874 transitions. [2019-09-10 06:14:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:12,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:14:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:13,167 INFO L225 Difference]: With dead ends: 1010166 [2019-09-10 06:14:13,168 INFO L226 Difference]: Without dead ends: 1010166 [2019-09-10 06:14:13,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010166 states. [2019-09-10 06:14:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010166 to 603466. [2019-09-10 06:14:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603466 states. [2019-09-10 06:14:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603466 states to 603466 states and 864958 transitions. [2019-09-10 06:14:31,107 INFO L78 Accepts]: Start accepts. Automaton has 603466 states and 864958 transitions. Word has length 312 [2019-09-10 06:14:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:31,107 INFO L475 AbstractCegarLoop]: Abstraction has 603466 states and 864958 transitions. [2019-09-10 06:14:31,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 603466 states and 864958 transitions. [2019-09-10 06:14:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:14:40,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:40,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:40,349 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 139721311, now seen corresponding path program 1 times [2019-09-10 06:14:40,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:40,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:40,465 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 06:14:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:40,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:40,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:40,467 INFO L87 Difference]: Start difference. First operand 603466 states and 864958 transitions. Second operand 3 states. [2019-09-10 06:14:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:43,070 INFO L93 Difference]: Finished difference Result 1070016 states and 1528078 transitions. [2019-09-10 06:14:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:43,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:14:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:44,157 INFO L225 Difference]: With dead ends: 1070016 [2019-09-10 06:14:44,157 INFO L226 Difference]: Without dead ends: 1070016 [2019-09-10 06:14:44,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:14:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070016 states. [2019-09-10 06:15:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070016 to 610462. [2019-09-10 06:15:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610462 states. [2019-09-10 06:15:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610462 states to 610462 states and 874645 transitions. [2019-09-10 06:15:07,753 INFO L78 Accepts]: Start accepts. Automaton has 610462 states and 874645 transitions. Word has length 314 [2019-09-10 06:15:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:07,754 INFO L475 AbstractCegarLoop]: Abstraction has 610462 states and 874645 transitions. [2019-09-10 06:15:07,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 610462 states and 874645 transitions. [2019-09-10 06:15:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:15:08,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:08,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:08,205 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:08,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1770431724, now seen corresponding path program 1 times [2019-09-10 06:15:08,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:08,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:08,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:15,495 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 06:15:15,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:15,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:15,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:15,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:15,499 INFO L87 Difference]: Start difference. First operand 610462 states and 874645 transitions. Second operand 3 states. [2019-09-10 06:15:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:18,175 INFO L93 Difference]: Finished difference Result 1078217 states and 1537476 transitions. [2019-09-10 06:15:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:18,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 06:15:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:19,155 INFO L225 Difference]: With dead ends: 1078217 [2019-09-10 06:15:19,155 INFO L226 Difference]: Without dead ends: 1078217 [2019-09-10 06:15:19,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:15:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078217 states. [2019-09-10 06:15:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078217 to 618663. [2019-09-10 06:15:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618663 states. [2019-09-10 06:15:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618663 states to 618663 states and 884043 transitions. [2019-09-10 06:15:38,276 INFO L78 Accepts]: Start accepts. Automaton has 618663 states and 884043 transitions. Word has length 315 [2019-09-10 06:15:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:38,276 INFO L475 AbstractCegarLoop]: Abstraction has 618663 states and 884043 transitions. [2019-09-10 06:15:38,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 618663 states and 884043 transitions. [2019-09-10 06:15:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:15:46,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:46,819 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:46,819 INFO L82 PathProgramCache]: Analyzing trace with hash 735787538, now seen corresponding path program 1 times [2019-09-10 06:15:46,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:46,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:46,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:46,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:46,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:47,083 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 06:15:47,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:47,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:47,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:47,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:47,085 INFO L87 Difference]: Start difference. First operand 618663 states and 884043 transitions. Second operand 4 states. [2019-09-10 06:15:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:49,251 INFO L93 Difference]: Finished difference Result 755801 states and 1068464 transitions. [2019-09-10 06:15:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:49,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 06:15:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:49,866 INFO L225 Difference]: With dead ends: 755801 [2019-09-10 06:15:49,866 INFO L226 Difference]: Without dead ends: 677676 [2019-09-10 06:15:49,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677676 states. [2019-09-10 06:16:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677676 to 677674. [2019-09-10 06:16:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677674 states. [2019-09-10 06:16:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677674 states to 677674 states and 960291 transitions. [2019-09-10 06:16:09,341 INFO L78 Accepts]: Start accepts. Automaton has 677674 states and 960291 transitions. Word has length 316 [2019-09-10 06:16:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:09,341 INFO L475 AbstractCegarLoop]: Abstraction has 677674 states and 960291 transitions. [2019-09-10 06:16:09,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 677674 states and 960291 transitions. [2019-09-10 06:16:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:16:19,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:19,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:19,036 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash 722707578, now seen corresponding path program 1 times [2019-09-10 06:16:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:19,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:19,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:19,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:19,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:19,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:19,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:19,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:19,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:19,274 INFO L87 Difference]: Start difference. First operand 677674 states and 960291 transitions. Second operand 4 states. [2019-09-10 06:16:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:23,640 INFO L93 Difference]: Finished difference Result 1333709 states and 1886156 transitions. [2019-09-10 06:16:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:23,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 06:16:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:24,971 INFO L225 Difference]: With dead ends: 1333709 [2019-09-10 06:16:24,971 INFO L226 Difference]: Without dead ends: 1333709 [2019-09-10 06:16:24,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:16:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333709 states. [2019-09-10 06:16:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333709 to 818169. [2019-09-10 06:16:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818169 states. [2019-09-10 06:16:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818169 states to 818169 states and 1159875 transitions. [2019-09-10 06:16:59,835 INFO L78 Accepts]: Start accepts. Automaton has 818169 states and 1159875 transitions. Word has length 318 [2019-09-10 06:16:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:59,835 INFO L475 AbstractCegarLoop]: Abstraction has 818169 states and 1159875 transitions. [2019-09-10 06:16:59,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 818169 states and 1159875 transitions. [2019-09-10 06:17:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:17:00,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:00,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:00,549 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1935844270, now seen corresponding path program 1 times [2019-09-10 06:17:00,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:00,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:00,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:00,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:00,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:00,790 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 06:17:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:00,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:17:00,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:00,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:17:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:17:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:17:00,792 INFO L87 Difference]: Start difference. First operand 818169 states and 1159875 transitions. Second operand 4 states. [2019-09-10 06:17:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:04,694 INFO L93 Difference]: Finished difference Result 1460549 states and 2064960 transitions. [2019-09-10 06:17:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:17:04,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 06:17:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:07,848 INFO L225 Difference]: With dead ends: 1460549 [2019-09-10 06:17:07,849 INFO L226 Difference]: Without dead ends: 1460549 [2019-09-10 06:17:07,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:17:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460549 states. [2019-09-10 06:17:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460549 to 950593. [2019-09-10 06:17:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950593 states. [2019-09-10 06:17:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950593 states to 950593 states and 1347476 transitions. [2019-09-10 06:17:35,642 INFO L78 Accepts]: Start accepts. Automaton has 950593 states and 1347476 transitions. Word has length 318 [2019-09-10 06:17:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:35,642 INFO L475 AbstractCegarLoop]: Abstraction has 950593 states and 1347476 transitions. [2019-09-10 06:17:35,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:17:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 950593 states and 1347476 transitions. [2019-09-10 06:17:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:17:49,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:49,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:49,188 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:49,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1577591053, now seen corresponding path program 1 times [2019-09-10 06:17:49,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:49,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:49,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:49,627 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 06:17:49,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:17:49,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:49,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:17:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:17:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:17:49,629 INFO L87 Difference]: Start difference. First operand 950593 states and 1347476 transitions. Second operand 9 states. [2019-09-10 06:17:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:54,124 INFO L93 Difference]: Finished difference Result 1270233 states and 1807319 transitions. [2019-09-10 06:17:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:17:54,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 320 [2019-09-10 06:17:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:55,379 INFO L225 Difference]: With dead ends: 1270233 [2019-09-10 06:17:55,379 INFO L226 Difference]: Without dead ends: 1270233 [2019-09-10 06:17:55,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:17:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270233 states. [2019-09-10 06:18:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270233 to 1270231. [2019-09-10 06:18:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270231 states. [2019-09-10 06:18:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270231 states to 1270231 states and 1807318 transitions. [2019-09-10 06:18:41,414 INFO L78 Accepts]: Start accepts. Automaton has 1270231 states and 1807318 transitions. Word has length 320 [2019-09-10 06:18:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:41,415 INFO L475 AbstractCegarLoop]: Abstraction has 1270231 states and 1807318 transitions. [2019-09-10 06:18:41,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:18:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1270231 states and 1807318 transitions. [2019-09-10 06:18:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:18:42,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:42,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:42,311 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -884890753, now seen corresponding path program 1 times [2019-09-10 06:18:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:42,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:42,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:42,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:42,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:44,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:44,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:18:44,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:44,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:18:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:18:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:18:44,046 INFO L87 Difference]: Start difference. First operand 1270231 states and 1807318 transitions. Second operand 16 states. [2019-09-10 06:19:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:03,548 INFO L93 Difference]: Finished difference Result 1754981 states and 2514461 transitions. [2019-09-10 06:19:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:19:03,549 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 320 [2019-09-10 06:19:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:06,696 INFO L225 Difference]: With dead ends: 1754981 [2019-09-10 06:19:06,696 INFO L226 Difference]: Without dead ends: 1754981 [2019-09-10 06:19:06,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=535, Invalid=1187, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:19:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754981 states. [2019-09-10 06:19:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754981 to 1330487. [2019-09-10 06:19:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330487 states. [2019-09-10 06:19:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330487 states to 1330487 states and 1880918 transitions. [2019-09-10 06:19:53,189 INFO L78 Accepts]: Start accepts. Automaton has 1330487 states and 1880918 transitions. Word has length 320 [2019-09-10 06:19:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:53,189 INFO L475 AbstractCegarLoop]: Abstraction has 1330487 states and 1880918 transitions. [2019-09-10 06:19:53,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:19:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1330487 states and 1880918 transitions.