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_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:07:48,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:07:48,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:07:48,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:07:48,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:07:48,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:07:48,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:07:48,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:07:48,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:07:48,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:07:48,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:07:48,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:07:48,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:07:48,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:07:48,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:07:48,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:07:48,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:07:48,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:07:48,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:07:48,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:07:48,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:07:48,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:07:48,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:07:48,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:07:48,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:07:48,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:07:48,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:07:48,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:07:48,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:07:48,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:07:48,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:07:48,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:07:48,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:07:48,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:07:48,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:07:48,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:07:48,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:07:48,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:07:48,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:07:48,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:07:48,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:07:48,932 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 09:07:48,947 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:07:48,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:07:48,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:07:48,948 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:07:48,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:07:48,949 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:07:48,949 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:07:48,950 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:07:48,950 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:07:48,950 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:07:48,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:07:48,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:07:48,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:07:48,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:07:48,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:07:48,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:07:48,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:07:48,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:07:48,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:07:48,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:07:48,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:07:48,953 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:07:48,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:07:48,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:07:48,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:07:48,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:07:48,954 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:07:48,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:07:48,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:07:48,955 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:07:48,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:07:49,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:07:49,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:07:49,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:07:49,007 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:07:49,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:07:49,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41781157/63052211d8fc4392a04c43409d2b672d/FLAG2f030a46a [2019-09-10 09:07:49,833 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:07:49,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:07:49,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41781157/63052211d8fc4392a04c43409d2b672d/FLAG2f030a46a [2019-09-10 09:07:49,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41781157/63052211d8fc4392a04c43409d2b672d [2019-09-10 09:07:49,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:07:49,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:07:49,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:07:49,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:07:49,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:07:49,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:07:49" (1/1) ... [2019-09-10 09:07:49,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3099779c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:49, skipping insertion in model container [2019-09-10 09:07:49,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:07:49" (1/1) ... [2019-09-10 09:07:49,966 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:07:50,133 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:07:51,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:07:51,506 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:07:52,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:07:52,250 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:07:52,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52 WrapperNode [2019-09-10 09:07:52,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:07:52,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:07:52,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:07:52,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:07:52,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (1/1) ... [2019-09-10 09:07:52,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:07:52,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:07:52,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:07:52,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:07:52,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (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 09:07:52,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:07:52,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:07:52,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:07:52,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:07:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:07:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:07:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:07:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:07:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:07:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:07:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:07:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:07:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:07:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:07:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:07:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:07:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:07:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:07:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:07:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:07:56,446 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:07:56,447 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:07:56,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:07:56 BoogieIcfgContainer [2019-09-10 09:07:56,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:07:56,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:07:56,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:07:56,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:07:56,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:07:49" (1/3) ... [2019-09-10 09:07:56,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaa1b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:07:56, skipping insertion in model container [2019-09-10 09:07:56,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:07:52" (2/3) ... [2019-09-10 09:07:56,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaa1b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:07:56, skipping insertion in model container [2019-09-10 09:07:56,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:07:56" (3/3) ... [2019-09-10 09:07:56,463 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:07:56,474 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:07:56,497 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:07:56,514 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:07:56,547 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:07:56,547 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:07:56,547 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:07:56,548 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:07:56,548 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:07:56,548 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:07:56,548 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:07:56,548 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:07:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states. [2019-09-10 09:07:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:07:56,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:56,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:56,657 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:56,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1298916417, now seen corresponding path program 1 times [2019-09-10 09:07:56,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:56,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:56,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:57,698 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 09:07:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:57,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:57,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:57,730 INFO L87 Difference]: Start difference. First operand 1549 states. Second operand 3 states. [2019-09-10 09:07:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:57,995 INFO L93 Difference]: Finished difference Result 2106 states and 3696 transitions. [2019-09-10 09:07:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:57,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-10 09:07:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:58,038 INFO L225 Difference]: With dead ends: 2106 [2019-09-10 09:07:58,038 INFO L226 Difference]: Without dead ends: 2098 [2019-09-10 09:07:58,041 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 09:07:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-09-10 09:07:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2096. [2019-09-10 09:07:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-10 09:07:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3504 transitions. [2019-09-10 09:07:58,204 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3504 transitions. Word has length 391 [2019-09-10 09:07:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:58,210 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3504 transitions. [2019-09-10 09:07:58,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3504 transitions. [2019-09-10 09:07:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:07:58,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:58,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:58,223 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash -163588012, now seen corresponding path program 1 times [2019-09-10 09:07:58,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:58,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:58,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:58,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:58,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:58,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:58,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:58,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:58,611 INFO L87 Difference]: Start difference. First operand 2096 states and 3504 transitions. Second operand 3 states. [2019-09-10 09:07:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:58,707 INFO L93 Difference]: Finished difference Result 3022 states and 5012 transitions. [2019-09-10 09:07:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:58,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-10 09:07:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:58,728 INFO L225 Difference]: With dead ends: 3022 [2019-09-10 09:07:58,729 INFO L226 Difference]: Without dead ends: 3022 [2019-09-10 09:07:58,730 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 09:07:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-10 09:07:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3020. [2019-09-10 09:07:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-09-10 09:07:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 5011 transitions. [2019-09-10 09:07:58,859 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 5011 transitions. Word has length 391 [2019-09-10 09:07:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:58,860 INFO L475 AbstractCegarLoop]: Abstraction has 3020 states and 5011 transitions. [2019-09-10 09:07:58,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 5011 transitions. [2019-09-10 09:07:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:07:58,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:58,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:58,871 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash -890084695, now seen corresponding path program 1 times [2019-09-10 09:07:58,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:58,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:58,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:58,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:58,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:59,322 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 09:07:59,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:59,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:59,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:59,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:59,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:59,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:59,326 INFO L87 Difference]: Start difference. First operand 3020 states and 5011 transitions. Second operand 4 states. [2019-09-10 09:07:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:59,497 INFO L93 Difference]: Finished difference Result 4088 states and 6788 transitions. [2019-09-10 09:07:59,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:59,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-10 09:07:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:59,527 INFO L225 Difference]: With dead ends: 4088 [2019-09-10 09:07:59,527 INFO L226 Difference]: Without dead ends: 4088 [2019-09-10 09:07:59,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 09:07:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-09-10 09:07:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 3346. [2019-09-10 09:07:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2019-09-10 09:07:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5565 transitions. [2019-09-10 09:07:59,675 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5565 transitions. Word has length 391 [2019-09-10 09:07:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:59,677 INFO L475 AbstractCegarLoop]: Abstraction has 3346 states and 5565 transitions. [2019-09-10 09:07:59,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:07:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5565 transitions. [2019-09-10 09:07:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:07:59,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:59,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:59,691 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2110188570, now seen corresponding path program 1 times [2019-09-10 09:07:59,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:59,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:00,153 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 09:08:00,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:00,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:00,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:00,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:00,157 INFO L87 Difference]: Start difference. First operand 3346 states and 5565 transitions. Second operand 3 states. [2019-09-10 09:08:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:00,319 INFO L93 Difference]: Finished difference Result 4728 states and 7868 transitions. [2019-09-10 09:08:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:00,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-10 09:08:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:00,349 INFO L225 Difference]: With dead ends: 4728 [2019-09-10 09:08:00,349 INFO L226 Difference]: Without dead ends: 4728 [2019-09-10 09:08:00,350 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 09:08:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-09-10 09:08:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 4726. [2019-09-10 09:08:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4726 states. [2019-09-10 09:08:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4726 states to 4726 states and 7867 transitions. [2019-09-10 09:08:00,510 INFO L78 Accepts]: Start accepts. Automaton has 4726 states and 7867 transitions. Word has length 391 [2019-09-10 09:08:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:00,511 INFO L475 AbstractCegarLoop]: Abstraction has 4726 states and 7867 transitions. [2019-09-10 09:08:00,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4726 states and 7867 transitions. [2019-09-10 09:08:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:08:00,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:00,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:00,533 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash 309299619, now seen corresponding path program 1 times [2019-09-10 09:08:00,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:00,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:00,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:01,062 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 09:08:01,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:01,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:08:01,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:01,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:08:01,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:08:01,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:08:01,065 INFO L87 Difference]: Start difference. First operand 4726 states and 7867 transitions. Second operand 5 states. [2019-09-10 09:08:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:01,347 INFO L93 Difference]: Finished difference Result 11614 states and 19420 transitions. [2019-09-10 09:08:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:01,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-09-10 09:08:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:01,422 INFO L225 Difference]: With dead ends: 11614 [2019-09-10 09:08:01,422 INFO L226 Difference]: Without dead ends: 11614 [2019-09-10 09:08:01,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11614 states. [2019-09-10 09:08:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11614 to 8922. [2019-09-10 09:08:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8922 states. [2019-09-10 09:08:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8922 states to 8922 states and 14905 transitions. [2019-09-10 09:08:01,762 INFO L78 Accepts]: Start accepts. Automaton has 8922 states and 14905 transitions. Word has length 392 [2019-09-10 09:08:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:01,763 INFO L475 AbstractCegarLoop]: Abstraction has 8922 states and 14905 transitions. [2019-09-10 09:08:01,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:08:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8922 states and 14905 transitions. [2019-09-10 09:08:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 09:08:01,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:01,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:01,779 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1339273494, now seen corresponding path program 1 times [2019-09-10 09:08:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:01,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:01,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:03,042 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 09:08:03,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:03,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:03,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:03,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:03,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:03,045 INFO L87 Difference]: Start difference. First operand 8922 states and 14905 transitions. Second operand 4 states. [2019-09-10 09:08:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:03,364 INFO L93 Difference]: Finished difference Result 22248 states and 37057 transitions. [2019-09-10 09:08:03,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:08:03,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-09-10 09:08:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:03,421 INFO L225 Difference]: With dead ends: 22248 [2019-09-10 09:08:03,422 INFO L226 Difference]: Without dead ends: 22248 [2019-09-10 09:08:03,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 09:08:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22248 states. [2019-09-10 09:08:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22248 to 16948. [2019-09-10 09:08:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16948 states. [2019-09-10 09:08:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16948 states to 16948 states and 28209 transitions. [2019-09-10 09:08:03,760 INFO L78 Accepts]: Start accepts. Automaton has 16948 states and 28209 transitions. Word has length 393 [2019-09-10 09:08:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:03,762 INFO L475 AbstractCegarLoop]: Abstraction has 16948 states and 28209 transitions. [2019-09-10 09:08:03,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:08:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 16948 states and 28209 transitions. [2019-09-10 09:08:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 09:08:03,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:03,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:03,791 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash 415719592, now seen corresponding path program 1 times [2019-09-10 09:08:03,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:03,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:03,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:05,142 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 09:08:05,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:05,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:05,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:05,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:05,144 INFO L87 Difference]: Start difference. First operand 16948 states and 28209 transitions. Second operand 3 states. [2019-09-10 09:08:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:05,325 INFO L93 Difference]: Finished difference Result 31884 states and 52712 transitions. [2019-09-10 09:08:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:05,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-09-10 09:08:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:05,397 INFO L225 Difference]: With dead ends: 31884 [2019-09-10 09:08:05,397 INFO L226 Difference]: Without dead ends: 31884 [2019-09-10 09:08:05,397 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 09:08:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31884 states. [2019-09-10 09:08:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31884 to 29126. [2019-09-10 09:08:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29126 states. [2019-09-10 09:08:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29126 states to 29126 states and 48187 transitions. [2019-09-10 09:08:05,943 INFO L78 Accepts]: Start accepts. Automaton has 29126 states and 48187 transitions. Word has length 393 [2019-09-10 09:08:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:05,944 INFO L475 AbstractCegarLoop]: Abstraction has 29126 states and 48187 transitions. [2019-09-10 09:08:05,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29126 states and 48187 transitions. [2019-09-10 09:08:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 09:08:05,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:05,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:05,970 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1945548778, now seen corresponding path program 1 times [2019-09-10 09:08:05,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:05,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:05,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:06,567 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 09:08:06,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:06,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:06,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:06,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:06,570 INFO L87 Difference]: Start difference. First operand 29126 states and 48187 transitions. Second operand 3 states. [2019-09-10 09:08:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:06,700 INFO L93 Difference]: Finished difference Result 25624 states and 42504 transitions. [2019-09-10 09:08:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:06,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-09-10 09:08:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:06,757 INFO L225 Difference]: With dead ends: 25624 [2019-09-10 09:08:06,757 INFO L226 Difference]: Without dead ends: 25624 [2019-09-10 09:08:06,758 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 09:08:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25624 states. [2019-09-10 09:08:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25624 to 25622. [2019-09-10 09:08:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25622 states. [2019-09-10 09:08:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25622 states to 25622 states and 42503 transitions. [2019-09-10 09:08:07,191 INFO L78 Accepts]: Start accepts. Automaton has 25622 states and 42503 transitions. Word has length 393 [2019-09-10 09:08:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:07,192 INFO L475 AbstractCegarLoop]: Abstraction has 25622 states and 42503 transitions. [2019-09-10 09:08:07,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 25622 states and 42503 transitions. [2019-09-10 09:08:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 09:08:07,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:07,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:07,206 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash -589180482, now seen corresponding path program 1 times [2019-09-10 09:08:07,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:07,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:07,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:07,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:07,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:08,048 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 09:08:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:08:08,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:08,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:08:08,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:08:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:08:08,050 INFO L87 Difference]: Start difference. First operand 25622 states and 42503 transitions. Second operand 6 states. [2019-09-10 09:08:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:08,523 INFO L93 Difference]: Finished difference Result 59536 states and 98770 transitions. [2019-09-10 09:08:08,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:08,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 393 [2019-09-10 09:08:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:08,658 INFO L225 Difference]: With dead ends: 59536 [2019-09-10 09:08:08,658 INFO L226 Difference]: Without dead ends: 59536 [2019-09-10 09:08:08,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59536 states. [2019-09-10 09:08:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59536 to 58138. [2019-09-10 09:08:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58138 states. [2019-09-10 09:08:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58138 states to 58138 states and 96679 transitions. [2019-09-10 09:08:10,662 INFO L78 Accepts]: Start accepts. Automaton has 58138 states and 96679 transitions. Word has length 393 [2019-09-10 09:08:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:10,663 INFO L475 AbstractCegarLoop]: Abstraction has 58138 states and 96679 transitions. [2019-09-10 09:08:10,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:08:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 58138 states and 96679 transitions. [2019-09-10 09:08:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 09:08:10,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:10,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:10,677 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash -684025065, now seen corresponding path program 1 times [2019-09-10 09:08:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:10,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:10,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:11,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 09:08:11,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:11,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:08:11,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:11,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:08:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:08:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:08:11,096 INFO L87 Difference]: Start difference. First operand 58138 states and 96679 transitions. Second operand 5 states. [2019-09-10 09:08:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:11,937 INFO L93 Difference]: Finished difference Result 216892 states and 360424 transitions. [2019-09-10 09:08:11,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:11,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 393 [2019-09-10 09:08:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:12,232 INFO L225 Difference]: With dead ends: 216892 [2019-09-10 09:08:12,232 INFO L226 Difference]: Without dead ends: 216892 [2019-09-10 09:08:12,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216892 states. [2019-09-10 09:08:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216892 to 162970. [2019-09-10 09:08:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162970 states. [2019-09-10 09:08:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162970 states to 162970 states and 270575 transitions. [2019-09-10 09:08:16,313 INFO L78 Accepts]: Start accepts. Automaton has 162970 states and 270575 transitions. Word has length 393 [2019-09-10 09:08:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:16,314 INFO L475 AbstractCegarLoop]: Abstraction has 162970 states and 270575 transitions. [2019-09-10 09:08:16,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:08:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 162970 states and 270575 transitions. [2019-09-10 09:08:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 09:08:16,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:16,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:16,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash -740359979, now seen corresponding path program 1 times [2019-09-10 09:08:16,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:16,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:16,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:16,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:17,052 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 09:08:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:17,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:17,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:17,054 INFO L87 Difference]: Start difference. First operand 162970 states and 270575 transitions. Second operand 4 states. [2019-09-10 09:08:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:19,909 INFO L93 Difference]: Finished difference Result 330906 states and 548525 transitions. [2019-09-10 09:08:19,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:08:19,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-09-10 09:08:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:20,361 INFO L225 Difference]: With dead ends: 330906 [2019-09-10 09:08:20,362 INFO L226 Difference]: Without dead ends: 330906 [2019-09-10 09:08:20,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 09:08:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330906 states. [2019-09-10 09:08:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330906 to 273274. [2019-09-10 09:08:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273274 states. [2019-09-10 09:08:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273274 states to 273274 states and 453383 transitions. [2019-09-10 09:08:27,453 INFO L78 Accepts]: Start accepts. Automaton has 273274 states and 453383 transitions. Word has length 393 [2019-09-10 09:08:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:27,454 INFO L475 AbstractCegarLoop]: Abstraction has 273274 states and 453383 transitions. [2019-09-10 09:08:27,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:08:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 273274 states and 453383 transitions. [2019-09-10 09:08:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-10 09:08:27,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:27,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:27,467 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1490887639, now seen corresponding path program 1 times [2019-09-10 09:08:27,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:27,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:27,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:27,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:27,859 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 09:08:27,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:27,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:27,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:27,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:27,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:27,861 INFO L87 Difference]: Start difference. First operand 273274 states and 453383 transitions. Second operand 3 states. [2019-09-10 09:08:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:28,117 INFO L93 Difference]: Finished difference Result 80722 states and 133970 transitions. [2019-09-10 09:08:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:28,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-10 09:08:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:28,233 INFO L225 Difference]: With dead ends: 80722 [2019-09-10 09:08:28,236 INFO L226 Difference]: Without dead ends: 80722 [2019-09-10 09:08:28,237 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 09:08:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80722 states. [2019-09-10 09:08:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80722 to 57846. [2019-09-10 09:08:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57846 states. [2019-09-10 09:08:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57846 states to 57846 states and 96029 transitions. [2019-09-10 09:08:29,911 INFO L78 Accepts]: Start accepts. Automaton has 57846 states and 96029 transitions. Word has length 397 [2019-09-10 09:08:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:29,912 INFO L475 AbstractCegarLoop]: Abstraction has 57846 states and 96029 transitions. [2019-09-10 09:08:29,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57846 states and 96029 transitions. [2019-09-10 09:08:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-10 09:08:29,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:29,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:29,922 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2065095072, now seen corresponding path program 1 times [2019-09-10 09:08:29,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:29,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:29,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:30,486 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 09:08:30,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:30,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:08:30,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:08:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:08:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:30,489 INFO L87 Difference]: Start difference. First operand 57846 states and 96029 transitions. Second operand 7 states. [2019-09-10 09:08:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:30,940 INFO L93 Difference]: Finished difference Result 68036 states and 112982 transitions. [2019-09-10 09:08:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:08:30,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 397 [2019-09-10 09:08:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:31,005 INFO L225 Difference]: With dead ends: 68036 [2019-09-10 09:08:31,006 INFO L226 Difference]: Without dead ends: 68036 [2019-09-10 09:08:31,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:08:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68036 states. [2019-09-10 09:08:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68036 to 60414. [2019-09-10 09:08:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60414 states. [2019-09-10 09:08:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60414 states to 60414 states and 100309 transitions. [2019-09-10 09:08:31,530 INFO L78 Accepts]: Start accepts. Automaton has 60414 states and 100309 transitions. Word has length 397 [2019-09-10 09:08:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:31,531 INFO L475 AbstractCegarLoop]: Abstraction has 60414 states and 100309 transitions. [2019-09-10 09:08:31,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:08:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60414 states and 100309 transitions. [2019-09-10 09:08:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-10 09:08:31,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:31,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:31,538 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1851405605, now seen corresponding path program 1 times [2019-09-10 09:08:31,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:31,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:31,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:33,560 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 09:08:33,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:33,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:33,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:33,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:33,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:33,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:33,562 INFO L87 Difference]: Start difference. First operand 60414 states and 100309 transitions. Second operand 3 states. [2019-09-10 09:08:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:33,901 INFO L93 Difference]: Finished difference Result 102097 states and 169451 transitions. [2019-09-10 09:08:33,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:33,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-10 09:08:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:34,069 INFO L225 Difference]: With dead ends: 102097 [2019-09-10 09:08:34,070 INFO L226 Difference]: Without dead ends: 102097 [2019-09-10 09:08:34,075 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 09:08:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102097 states. [2019-09-10 09:08:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102097 to 97879. [2019-09-10 09:08:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97879 states. [2019-09-10 09:08:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97879 states to 97879 states and 161902 transitions. [2019-09-10 09:08:35,245 INFO L78 Accepts]: Start accepts. Automaton has 97879 states and 161902 transitions. Word has length 398 [2019-09-10 09:08:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:35,246 INFO L475 AbstractCegarLoop]: Abstraction has 97879 states and 161902 transitions. [2019-09-10 09:08:35,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 97879 states and 161902 transitions. [2019-09-10 09:08:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-10 09:08:35,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:35,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:35,253 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1041603629, now seen corresponding path program 1 times [2019-09-10 09:08:35,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:35,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:36,146 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 09:08:36,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:36,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:36,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:36,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:36,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:36,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:36,148 INFO L87 Difference]: Start difference. First operand 97879 states and 161902 transitions. Second operand 4 states. [2019-09-10 09:08:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:36,612 INFO L93 Difference]: Finished difference Result 167386 states and 274296 transitions. [2019-09-10 09:08:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:08:36,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2019-09-10 09:08:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:36,794 INFO L225 Difference]: With dead ends: 167386 [2019-09-10 09:08:36,794 INFO L226 Difference]: Without dead ends: 167386 [2019-09-10 09:08:36,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167386 states. [2019-09-10 09:08:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167386 to 167382. [2019-09-10 09:08:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167382 states. [2019-09-10 09:08:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167382 states to 167382 states and 274294 transitions. [2019-09-10 09:08:38,648 INFO L78 Accepts]: Start accepts. Automaton has 167382 states and 274294 transitions. Word has length 398 [2019-09-10 09:08:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 167382 states and 274294 transitions. [2019-09-10 09:08:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:08:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 167382 states and 274294 transitions. [2019-09-10 09:08:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-10 09:08:38,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:38,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:38,658 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1545084735, now seen corresponding path program 1 times [2019-09-10 09:08:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:38,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:38,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:38,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:38,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:39,394 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 09:08:39,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:39,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:08:39,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:39,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:08:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:08:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:08:39,397 INFO L87 Difference]: Start difference. First operand 167382 states and 274294 transitions. Second operand 5 states. [2019-09-10 09:08:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:39,914 INFO L93 Difference]: Finished difference Result 205138 states and 335401 transitions. [2019-09-10 09:08:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:39,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 398 [2019-09-10 09:08:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:40,156 INFO L225 Difference]: With dead ends: 205138 [2019-09-10 09:08:40,156 INFO L226 Difference]: Without dead ends: 205138 [2019-09-10 09:08:40,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:08:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205138 states. [2019-09-10 09:08:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205138 to 169016. [2019-09-10 09:08:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169016 states. [2019-09-10 09:08:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169016 states to 169016 states and 276854 transitions. [2019-09-10 09:08:42,481 INFO L78 Accepts]: Start accepts. Automaton has 169016 states and 276854 transitions. Word has length 398 [2019-09-10 09:08:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:42,482 INFO L475 AbstractCegarLoop]: Abstraction has 169016 states and 276854 transitions. [2019-09-10 09:08:42,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:08:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 169016 states and 276854 transitions. [2019-09-10 09:08:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-10 09:08:42,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:42,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:42,491 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1032697416, now seen corresponding path program 1 times [2019-09-10 09:08:42,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:42,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:42,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:42,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:43,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:43,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:08:43,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:43,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:08:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:08:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:08:43,639 INFO L87 Difference]: Start difference. First operand 169016 states and 276854 transitions. Second operand 6 states. [2019-09-10 09:08:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:44,592 INFO L93 Difference]: Finished difference Result 298388 states and 488735 transitions. [2019-09-10 09:08:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:44,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 398 [2019-09-10 09:08:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:44,959 INFO L225 Difference]: With dead ends: 298388 [2019-09-10 09:08:44,959 INFO L226 Difference]: Without dead ends: 298388 [2019-09-10 09:08:44,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298388 states. [2019-09-10 09:08:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298388 to 289418. [2019-09-10 09:08:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289418 states. [2019-09-10 09:08:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289418 states to 289418 states and 474488 transitions. [2019-09-10 09:08:54,645 INFO L78 Accepts]: Start accepts. Automaton has 289418 states and 474488 transitions. Word has length 398 [2019-09-10 09:08:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:54,645 INFO L475 AbstractCegarLoop]: Abstraction has 289418 states and 474488 transitions. [2019-09-10 09:08:54,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:08:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 289418 states and 474488 transitions. [2019-09-10 09:08:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-10 09:08:54,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:54,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:54,654 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 116052973, now seen corresponding path program 1 times [2019-09-10 09:08:54,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:54,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:54,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:55,104 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 09:08:55,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:55,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:55,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:55,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:55,107 INFO L87 Difference]: Start difference. First operand 289418 states and 474488 transitions. Second operand 3 states. [2019-09-10 09:08:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:56,167 INFO L93 Difference]: Finished difference Result 287036 states and 469574 transitions. [2019-09-10 09:08:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:56,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-10 09:08:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:56,557 INFO L225 Difference]: With dead ends: 287036 [2019-09-10 09:08:56,557 INFO L226 Difference]: Without dead ends: 287036 [2019-09-10 09:08:56,557 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 09:08:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287036 states. [2019-09-10 09:09:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287036 to 287034. [2019-09-10 09:09:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287034 states. [2019-09-10 09:09:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287034 states to 287034 states and 469573 transitions. [2019-09-10 09:09:05,643 INFO L78 Accepts]: Start accepts. Automaton has 287034 states and 469573 transitions. Word has length 398 [2019-09-10 09:09:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:05,644 INFO L475 AbstractCegarLoop]: Abstraction has 287034 states and 469573 transitions. [2019-09-10 09:09:05,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:09:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 287034 states and 469573 transitions. [2019-09-10 09:09:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-10 09:09:05,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:05,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:09:05,650 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 141759601, now seen corresponding path program 1 times [2019-09-10 09:09:05,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:05,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:05,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:05,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:09:05,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:05,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:09:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:09:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:09:05,969 INFO L87 Difference]: Start difference. First operand 287034 states and 469573 transitions. Second operand 3 states. [2019-09-10 09:09:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:12,072 INFO L93 Difference]: Finished difference Result 490607 states and 799033 transitions. [2019-09-10 09:09:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:09:12,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-10 09:09:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:12,679 INFO L225 Difference]: With dead ends: 490607 [2019-09-10 09:09:12,680 INFO L226 Difference]: Without dead ends: 490607 [2019-09-10 09:09:12,680 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 09:09:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490607 states. [2019-09-10 09:09:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490607 to 446067. [2019-09-10 09:09:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446067 states. [2019-09-10 09:09:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446067 states to 446067 states and 725840 transitions. [2019-09-10 09:09:17,600 INFO L78 Accepts]: Start accepts. Automaton has 446067 states and 725840 transitions. Word has length 399 [2019-09-10 09:09:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:17,601 INFO L475 AbstractCegarLoop]: Abstraction has 446067 states and 725840 transitions. [2019-09-10 09:09:17,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:09:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 446067 states and 725840 transitions. [2019-09-10 09:09:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-10 09:09:17,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:17,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:09:17,612 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2083811022, now seen corresponding path program 1 times [2019-09-10 09:09:17,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:17,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:17,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:18,962 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 09:09:18,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:18,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:09:18,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:18,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:09:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:09:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:09:18,964 INFO L87 Difference]: Start difference. First operand 446067 states and 725840 transitions. Second operand 3 states. [2019-09-10 09:09:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:20,165 INFO L93 Difference]: Finished difference Result 444373 states and 723213 transitions. [2019-09-10 09:09:20,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:09:20,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-10 09:09:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:20,724 INFO L225 Difference]: With dead ends: 444373 [2019-09-10 09:09:20,724 INFO L226 Difference]: Without dead ends: 444373 [2019-09-10 09:09:20,725 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 09:09:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444373 states. [2019-09-10 09:09:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444373 to 444371. [2019-09-10 09:09:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444371 states. [2019-09-10 09:09:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444371 states to 444371 states and 723212 transitions. [2019-09-10 09:09:34,024 INFO L78 Accepts]: Start accepts. Automaton has 444371 states and 723212 transitions. Word has length 399 [2019-09-10 09:09:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:34,024 INFO L475 AbstractCegarLoop]: Abstraction has 444371 states and 723212 transitions. [2019-09-10 09:09:34,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:09:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 444371 states and 723212 transitions. [2019-09-10 09:09:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:09:34,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:34,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:09:34,033 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 518999334, now seen corresponding path program 1 times [2019-09-10 09:09:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:34,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:40,222 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 09:09:40,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:40,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:09:40,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:40,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:09:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:09:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:09:40,223 INFO L87 Difference]: Start difference. First operand 444371 states and 723212 transitions. Second operand 6 states. [2019-09-10 09:09:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:42,181 INFO L93 Difference]: Finished difference Result 513865 states and 836217 transitions. [2019-09-10 09:09:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:09:42,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-10 09:09:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:42,856 INFO L225 Difference]: With dead ends: 513865 [2019-09-10 09:09:42,856 INFO L226 Difference]: Without dead ends: 513865 [2019-09-10 09:09:42,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:09:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513865 states. [2019-09-10 09:09:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513865 to 505275. [2019-09-10 09:09:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505275 states. [2019-09-10 09:09:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505275 states to 505275 states and 822782 transitions. [2019-09-10 09:09:53,751 INFO L78 Accepts]: Start accepts. Automaton has 505275 states and 822782 transitions. Word has length 403 [2019-09-10 09:09:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:53,752 INFO L475 AbstractCegarLoop]: Abstraction has 505275 states and 822782 transitions. [2019-09-10 09:09:53,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:09:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 505275 states and 822782 transitions. [2019-09-10 09:09:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-10 09:09:53,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:53,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:09:53,760 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1132730971, now seen corresponding path program 1 times [2019-09-10 09:09:53,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:53,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:53,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:53,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:53,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:54,293 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 19 [2019-09-10 09:10:01,211 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 09:10:01,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:10:01,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:10:01,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:10:01,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:10:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:10:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:10:01,213 INFO L87 Difference]: Start difference. First operand 505275 states and 822782 transitions. Second operand 8 states. [2019-09-10 09:10:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:10:06,201 INFO L93 Difference]: Finished difference Result 1456798 states and 2353637 transitions. [2019-09-10 09:10:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:10:06,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 404 [2019-09-10 09:10:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:10:08,349 INFO L225 Difference]: With dead ends: 1456798 [2019-09-10 09:10:08,350 INFO L226 Difference]: Without dead ends: 1456798 [2019-09-10 09:10:08,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:10:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456798 states. [2019-09-10 09:10:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456798 to 1003232. [2019-09-10 09:10:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003232 states. [2019-09-10 09:10:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003232 states to 1003232 states and 1630982 transitions. [2019-09-10 09:10:50,786 INFO L78 Accepts]: Start accepts. Automaton has 1003232 states and 1630982 transitions. Word has length 404 [2019-09-10 09:10:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:10:50,786 INFO L475 AbstractCegarLoop]: Abstraction has 1003232 states and 1630982 transitions. [2019-09-10 09:10:50,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:10:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1003232 states and 1630982 transitions. [2019-09-10 09:10:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-10 09:10:50,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:10:50,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:10:50,792 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:10:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:10:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash 425067665, now seen corresponding path program 1 times [2019-09-10 09:10:50,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:10:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:10:50,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:10:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:10:50,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:10:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:10:51,085 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 09:10:51,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:10:51,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:10:51,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:10:51,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:10:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:10:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:10:51,086 INFO L87 Difference]: Start difference. First operand 1003232 states and 1630982 transitions. Second operand 3 states. [2019-09-10 09:11:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:08,022 INFO L93 Difference]: Finished difference Result 1966855 states and 3187390 transitions. [2019-09-10 09:11:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:11:08,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-10 09:11:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:12,732 INFO L225 Difference]: With dead ends: 1966855 [2019-09-10 09:11:12,732 INFO L226 Difference]: Without dead ends: 1966855 [2019-09-10 09:11:12,732 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 09:11:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966855 states.