java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:19:01,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:19:01,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:19:01,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:19:01,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:19:01,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:19:01,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:19:01,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:19:01,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:19:01,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:19:01,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:19:01,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:19:01,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:19:01,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:19:01,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:19:01,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:19:01,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:19:01,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:19:01,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:19:01,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:19:01,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:19:01,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:19:01,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:19:01,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:19:01,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:19:01,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:19:01,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:19:01,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:19:01,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:19:01,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:19:01,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:19:01,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:19:01,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:19:01,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:19:01,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:19:01,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:19:01,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:19:01,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:19:01,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:19:01,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:19:01,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:19:01,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:19:01,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:19:01,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:19:01,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:19:01,943 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:19:01,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:19:01,944 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:19:01,945 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:19:01,945 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:19:01,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:19:01,945 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:19:01,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:19:01,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:19:01,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:19:01,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:19:01,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:19:01,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:19:01,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:19:01,947 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:19:01,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:19:01,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:19:01,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:19:01,948 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:19:01,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:19:01,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:19:01,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:19:01,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:19:01,949 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:19:01,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:19:01,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:19:01,950 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:19:01,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:19:01,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:19:01,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:19:01,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:19:01,995 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:19:01,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:19:02,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859fcf848/096b70775e6644848cf4af4b02076bf5/FLAGfa80caac5 [2019-09-10 06:19:02,672 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:19:02,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:19:02,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859fcf848/096b70775e6644848cf4af4b02076bf5/FLAGfa80caac5 [2019-09-10 06:19:02,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859fcf848/096b70775e6644848cf4af4b02076bf5 [2019-09-10 06:19:02,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:19:02,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:19:02,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:19:02,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:19:02,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:19:02,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:19:02" (1/1) ... [2019-09-10 06:19:02,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a97da8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:02, skipping insertion in model container [2019-09-10 06:19:02,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:19:02" (1/1) ... [2019-09-10 06:19:02,881 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:19:02,983 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:19:03,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:19:03,814 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:19:04,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:19:04,309 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:19:04,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04 WrapperNode [2019-09-10 06:19:04,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:19:04,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:19:04,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:19:04,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:19:04,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... [2019-09-10 06:19:04,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:19:04,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:19:04,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:19:04,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:19:04,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:19:04,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:19:04,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:19:04,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:19:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:19:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:19:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:19:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:19:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:19:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:19:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:19:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:19:04,618 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:19:04,618 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:19:04,619 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:19:04,619 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:19:04,620 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:19:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:19:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:19:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:19:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:19:07,059 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:19:07,060 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:19:07,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:19:07 BoogieIcfgContainer [2019-09-10 06:19:07,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:19:07,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:19:07,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:19:07,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:19:07,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:19:02" (1/3) ... [2019-09-10 06:19:07,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8dec3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:19:07, skipping insertion in model container [2019-09-10 06:19:07,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:19:04" (2/3) ... [2019-09-10 06:19:07,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8dec3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:19:07, skipping insertion in model container [2019-09-10 06:19:07,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:19:07" (3/3) ... [2019-09-10 06:19:07,074 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:19:07,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:19:07,103 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:19:07,119 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:19:07,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:19:07,152 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:19:07,152 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:19:07,152 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:19:07,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:19:07,152 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:19:07,153 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:19:07,153 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:19:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states. [2019-09-10 06:19:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 06:19:07,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:07,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] [2019-09-10 06:19:07,226 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1097612231, now seen corresponding path program 1 times [2019-09-10 06:19:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:07,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:07,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:08,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:08,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:08,494 INFO L87 Difference]: Start difference. First operand 632 states. Second operand 4 states. [2019-09-10 06:19:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:08,856 INFO L93 Difference]: Finished difference Result 1235 states and 2197 transitions. [2019-09-10 06:19:08,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:19:08,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 06:19:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:08,882 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 06:19:08,882 INFO L226 Difference]: Without dead ends: 1227 [2019-09-10 06:19:08,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-10 06:19:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1192. [2019-09-10 06:19:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-09-10 06:19:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1850 transitions. [2019-09-10 06:19:09,053 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1850 transitions. Word has length 239 [2019-09-10 06:19:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:09,056 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1850 transitions. [2019-09-10 06:19:09,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1850 transitions. [2019-09-10 06:19:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 06:19:09,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:09,074 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] [2019-09-10 06:19:09,074 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash -772194149, now seen corresponding path program 1 times [2019-09-10 06:19:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:09,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:09,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:09,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:09,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:09,333 INFO L87 Difference]: Start difference. First operand 1192 states and 1850 transitions. Second operand 3 states. [2019-09-10 06:19:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:09,426 INFO L93 Difference]: Finished difference Result 2339 states and 3611 transitions. [2019-09-10 06:19:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:09,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 06:19:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:09,440 INFO L225 Difference]: With dead ends: 2339 [2019-09-10 06:19:09,441 INFO L226 Difference]: Without dead ends: 2339 [2019-09-10 06:19:09,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-09-10 06:19:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2306. [2019-09-10 06:19:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-09-10 06:19:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3566 transitions. [2019-09-10 06:19:09,505 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3566 transitions. Word has length 241 [2019-09-10 06:19:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:09,506 INFO L475 AbstractCegarLoop]: Abstraction has 2306 states and 3566 transitions. [2019-09-10 06:19:09,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3566 transitions. [2019-09-10 06:19:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 06:19:09,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:09,515 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] [2019-09-10 06:19:09,516 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1792703498, now seen corresponding path program 1 times [2019-09-10 06:19:09,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:09,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:09,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:09,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:09,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:09,710 INFO L87 Difference]: Start difference. First operand 2306 states and 3566 transitions. Second operand 3 states. [2019-09-10 06:19:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:09,778 INFO L93 Difference]: Finished difference Result 4579 states and 7072 transitions. [2019-09-10 06:19:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:09,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 06:19:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:09,811 INFO L225 Difference]: With dead ends: 4579 [2019-09-10 06:19:09,811 INFO L226 Difference]: Without dead ends: 4579 [2019-09-10 06:19:09,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-09-10 06:19:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 2325. [2019-09-10 06:19:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2019-09-10 06:19:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3594 transitions. [2019-09-10 06:19:09,890 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 3594 transitions. Word has length 241 [2019-09-10 06:19:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:09,891 INFO L475 AbstractCegarLoop]: Abstraction has 2325 states and 3594 transitions. [2019-09-10 06:19:09,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 3594 transitions. [2019-09-10 06:19:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 06:19:09,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:09,897 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] [2019-09-10 06:19:09,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:09,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1658210589, now seen corresponding path program 1 times [2019-09-10 06:19:09,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:09,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:09,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:10,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:10,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:10,006 INFO L87 Difference]: Start difference. First operand 2325 states and 3594 transitions. Second operand 3 states. [2019-09-10 06:19:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:10,072 INFO L93 Difference]: Finished difference Result 4597 states and 7093 transitions. [2019-09-10 06:19:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:10,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-10 06:19:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:10,095 INFO L225 Difference]: With dead ends: 4597 [2019-09-10 06:19:10,095 INFO L226 Difference]: Without dead ends: 4597 [2019-09-10 06:19:10,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2019-09-10 06:19:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 2343. [2019-09-10 06:19:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2019-09-10 06:19:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3615 transitions. [2019-09-10 06:19:10,216 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3615 transitions. Word has length 242 [2019-09-10 06:19:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:10,216 INFO L475 AbstractCegarLoop]: Abstraction has 2343 states and 3615 transitions. [2019-09-10 06:19:10,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3615 transitions. [2019-09-10 06:19:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 06:19:10,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:10,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] [2019-09-10 06:19:10,223 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -834590880, now seen corresponding path program 1 times [2019-09-10 06:19:10,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:10,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:10,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:10,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:10,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:10,451 INFO L87 Difference]: Start difference. First operand 2343 states and 3615 transitions. Second operand 3 states. [2019-09-10 06:19:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:10,566 INFO L93 Difference]: Finished difference Result 4507 states and 6900 transitions. [2019-09-10 06:19:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:10,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-09-10 06:19:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:10,589 INFO L225 Difference]: With dead ends: 4507 [2019-09-10 06:19:10,589 INFO L226 Difference]: Without dead ends: 4507 [2019-09-10 06:19:10,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-09-10 06:19:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4476. [2019-09-10 06:19:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-09-10 06:19:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 6859 transitions. [2019-09-10 06:19:10,725 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 6859 transitions. Word has length 243 [2019-09-10 06:19:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:10,727 INFO L475 AbstractCegarLoop]: Abstraction has 4476 states and 6859 transitions. [2019-09-10 06:19:10,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 6859 transitions. [2019-09-10 06:19:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 06:19:10,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:10,745 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] [2019-09-10 06:19:10,746 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -326836125, now seen corresponding path program 1 times [2019-09-10 06:19:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:11,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:11,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:11,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:11,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:11,368 INFO L87 Difference]: Start difference. First operand 4476 states and 6859 transitions. Second operand 4 states. [2019-09-10 06:19:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:11,493 INFO L93 Difference]: Finished difference Result 8113 states and 12337 transitions. [2019-09-10 06:19:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:11,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-09-10 06:19:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:11,555 INFO L225 Difference]: With dead ends: 8113 [2019-09-10 06:19:11,555 INFO L226 Difference]: Without dead ends: 8113 [2019-09-10 06:19:11,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8113 states. [2019-09-10 06:19:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8113 to 4711. [2019-09-10 06:19:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4711 states. [2019-09-10 06:19:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4711 states to 4711 states and 7247 transitions. [2019-09-10 06:19:11,714 INFO L78 Accepts]: Start accepts. Automaton has 4711 states and 7247 transitions. Word has length 243 [2019-09-10 06:19:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:11,714 INFO L475 AbstractCegarLoop]: Abstraction has 4711 states and 7247 transitions. [2019-09-10 06:19:11,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4711 states and 7247 transitions. [2019-09-10 06:19:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:19:11,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:11,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:11,733 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash -311970492, now seen corresponding path program 1 times [2019-09-10 06:19:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:11,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:11,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:11,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:11,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:11,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:11,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:11,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:11,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:11,885 INFO L87 Difference]: Start difference. First operand 4711 states and 7247 transitions. Second operand 3 states. [2019-09-10 06:19:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:11,971 INFO L93 Difference]: Finished difference Result 8655 states and 13138 transitions. [2019-09-10 06:19:11,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:11,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-10 06:19:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:11,997 INFO L225 Difference]: With dead ends: 8655 [2019-09-10 06:19:11,998 INFO L226 Difference]: Without dead ends: 8655 [2019-09-10 06:19:11,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8655 states. [2019-09-10 06:19:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8655 to 4815. [2019-09-10 06:19:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2019-09-10 06:19:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 7390 transitions. [2019-09-10 06:19:12,263 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 7390 transitions. Word has length 245 [2019-09-10 06:19:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:12,264 INFO L475 AbstractCegarLoop]: Abstraction has 4815 states and 7390 transitions. [2019-09-10 06:19:12,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 7390 transitions. [2019-09-10 06:19:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 06:19:12,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:12,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:12,275 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1859282707, now seen corresponding path program 1 times [2019-09-10 06:19:12,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:12,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:12,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:12,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:12,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:12,399 INFO L87 Difference]: Start difference. First operand 4815 states and 7390 transitions. Second operand 3 states. [2019-09-10 06:19:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:12,460 INFO L93 Difference]: Finished difference Result 8780 states and 13284 transitions. [2019-09-10 06:19:12,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:12,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-10 06:19:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:12,481 INFO L225 Difference]: With dead ends: 8780 [2019-09-10 06:19:12,481 INFO L226 Difference]: Without dead ends: 8780 [2019-09-10 06:19:12,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2019-09-10 06:19:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 4940. [2019-09-10 06:19:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2019-09-10 06:19:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 7536 transitions. [2019-09-10 06:19:12,609 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 7536 transitions. Word has length 246 [2019-09-10 06:19:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:12,609 INFO L475 AbstractCegarLoop]: Abstraction has 4940 states and 7536 transitions. [2019-09-10 06:19:12,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 7536 transitions. [2019-09-10 06:19:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 06:19:12,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:12,621 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] [2019-09-10 06:19:12,621 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2034335695, now seen corresponding path program 1 times [2019-09-10 06:19:12,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:12,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:12,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:12,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:12,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:12,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:12,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:12,929 INFO L87 Difference]: Start difference. First operand 4940 states and 7536 transitions. Second operand 4 states. [2019-09-10 06:19:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:12,996 INFO L93 Difference]: Finished difference Result 5147 states and 7894 transitions. [2019-09-10 06:19:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:12,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-10 06:19:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:13,007 INFO L225 Difference]: With dead ends: 5147 [2019-09-10 06:19:13,008 INFO L226 Difference]: Without dead ends: 4350 [2019-09-10 06:19:13,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2019-09-10 06:19:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4330. [2019-09-10 06:19:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-09-10 06:19:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6627 transitions. [2019-09-10 06:19:13,141 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6627 transitions. Word has length 247 [2019-09-10 06:19:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:13,142 INFO L475 AbstractCegarLoop]: Abstraction has 4330 states and 6627 transitions. [2019-09-10 06:19:13,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6627 transitions. [2019-09-10 06:19:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 06:19:13,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:13,152 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] [2019-09-10 06:19:13,152 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:13,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 749195596, now seen corresponding path program 1 times [2019-09-10 06:19:13,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:13,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:13,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:13,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:13,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:13,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:13,336 INFO L87 Difference]: Start difference. First operand 4330 states and 6627 transitions. Second operand 3 states. [2019-09-10 06:19:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:13,888 INFO L93 Difference]: Finished difference Result 6947 states and 10505 transitions. [2019-09-10 06:19:13,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:13,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-10 06:19:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:13,906 INFO L225 Difference]: With dead ends: 6947 [2019-09-10 06:19:13,906 INFO L226 Difference]: Without dead ends: 6947 [2019-09-10 06:19:13,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2019-09-10 06:19:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 6882. [2019-09-10 06:19:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6882 states. [2019-09-10 06:19:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6882 states to 6882 states and 10417 transitions. [2019-09-10 06:19:14,031 INFO L78 Accepts]: Start accepts. Automaton has 6882 states and 10417 transitions. Word has length 247 [2019-09-10 06:19:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:14,032 INFO L475 AbstractCegarLoop]: Abstraction has 6882 states and 10417 transitions. [2019-09-10 06:19:14,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6882 states and 10417 transitions. [2019-09-10 06:19:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 06:19:14,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:14,046 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] [2019-09-10 06:19:14,046 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2094441447, now seen corresponding path program 1 times [2019-09-10 06:19:14,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:14,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:14,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:14,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:14,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:14,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:14,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:14,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:14,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:14,589 INFO L87 Difference]: Start difference. First operand 6882 states and 10417 transitions. Second operand 4 states. [2019-09-10 06:19:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:14,732 INFO L93 Difference]: Finished difference Result 13261 states and 19909 transitions. [2019-09-10 06:19:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:14,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-10 06:19:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:14,759 INFO L225 Difference]: With dead ends: 13261 [2019-09-10 06:19:14,760 INFO L226 Difference]: Without dead ends: 13261 [2019-09-10 06:19:14,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2019-09-10 06:19:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 13235. [2019-09-10 06:19:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13235 states. [2019-09-10 06:19:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13235 states to 13235 states and 19875 transitions. [2019-09-10 06:19:14,972 INFO L78 Accepts]: Start accepts. Automaton has 13235 states and 19875 transitions. Word has length 247 [2019-09-10 06:19:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:14,973 INFO L475 AbstractCegarLoop]: Abstraction has 13235 states and 19875 transitions. [2019-09-10 06:19:14,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13235 states and 19875 transitions. [2019-09-10 06:19:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 06:19:14,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:14,997 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] [2019-09-10 06:19:14,997 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2013512940, now seen corresponding path program 1 times [2019-09-10 06:19:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:14,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:14,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:15,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:15,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:15,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:15,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:15,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:15,175 INFO L87 Difference]: Start difference. First operand 13235 states and 19875 transitions. Second operand 3 states. [2019-09-10 06:19:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:15,315 INFO L93 Difference]: Finished difference Result 25478 states and 37874 transitions. [2019-09-10 06:19:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:15,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-10 06:19:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:15,374 INFO L225 Difference]: With dead ends: 25478 [2019-09-10 06:19:15,374 INFO L226 Difference]: Without dead ends: 25478 [2019-09-10 06:19:15,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25478 states. [2019-09-10 06:19:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25478 to 25454. [2019-09-10 06:19:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25454 states. [2019-09-10 06:19:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25454 states to 25454 states and 37844 transitions. [2019-09-10 06:19:15,908 INFO L78 Accepts]: Start accepts. Automaton has 25454 states and 37844 transitions. Word has length 249 [2019-09-10 06:19:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:15,909 INFO L475 AbstractCegarLoop]: Abstraction has 25454 states and 37844 transitions. [2019-09-10 06:19:15,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states and 37844 transitions. [2019-09-10 06:19:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 06:19:15,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:15,954 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] [2019-09-10 06:19:15,954 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1237846159, now seen corresponding path program 1 times [2019-09-10 06:19:15,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:15,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:15,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:16,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 06:19:16,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:16,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:16,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:16,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:16,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:16,155 INFO L87 Difference]: Start difference. First operand 25454 states and 37844 transitions. Second operand 3 states. [2019-09-10 06:19:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:16,354 INFO L93 Difference]: Finished difference Result 49665 states and 73257 transitions. [2019-09-10 06:19:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:16,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-10 06:19:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:16,434 INFO L225 Difference]: With dead ends: 49665 [2019-09-10 06:19:16,435 INFO L226 Difference]: Without dead ends: 49665 [2019-09-10 06:19:16,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49665 states. [2019-09-10 06:19:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49665 to 49643. [2019-09-10 06:19:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49643 states. [2019-09-10 06:19:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49643 states to 49643 states and 73231 transitions. [2019-09-10 06:19:18,049 INFO L78 Accepts]: Start accepts. Automaton has 49643 states and 73231 transitions. Word has length 251 [2019-09-10 06:19:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:18,050 INFO L475 AbstractCegarLoop]: Abstraction has 49643 states and 73231 transitions. [2019-09-10 06:19:18,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49643 states and 73231 transitions. [2019-09-10 06:19:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 06:19:18,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:18,116 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] [2019-09-10 06:19:18,116 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash -708861388, now seen corresponding path program 1 times [2019-09-10 06:19:18,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:18,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:18,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:18,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:18,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:18,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:18,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:18,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:18,349 INFO L87 Difference]: Start difference. First operand 49643 states and 73231 transitions. Second operand 4 states. [2019-09-10 06:19:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:18,604 INFO L93 Difference]: Finished difference Result 82202 states and 120605 transitions. [2019-09-10 06:19:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:18,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-10 06:19:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:18,721 INFO L225 Difference]: With dead ends: 82202 [2019-09-10 06:19:18,721 INFO L226 Difference]: Without dead ends: 82202 [2019-09-10 06:19:18,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82202 states. [2019-09-10 06:19:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82202 to 48558. [2019-09-10 06:19:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48558 states. [2019-09-10 06:19:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48558 states to 48558 states and 71663 transitions. [2019-09-10 06:19:20,953 INFO L78 Accepts]: Start accepts. Automaton has 48558 states and 71663 transitions. Word has length 251 [2019-09-10 06:19:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:20,954 INFO L475 AbstractCegarLoop]: Abstraction has 48558 states and 71663 transitions. [2019-09-10 06:19:20,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 48558 states and 71663 transitions. [2019-09-10 06:19:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 06:19:21,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:21,039 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] [2019-09-10 06:19:21,040 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1536435996, now seen corresponding path program 1 times [2019-09-10 06:19:21,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:21,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:21,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:21,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:21,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:21,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:21,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:21,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:21,154 INFO L87 Difference]: Start difference. First operand 48558 states and 71663 transitions. Second operand 3 states. [2019-09-10 06:19:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:21,376 INFO L93 Difference]: Finished difference Result 83996 states and 123299 transitions. [2019-09-10 06:19:21,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:21,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-10 06:19:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:21,500 INFO L225 Difference]: With dead ends: 83996 [2019-09-10 06:19:21,500 INFO L226 Difference]: Without dead ends: 83996 [2019-09-10 06:19:21,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83996 states. [2019-09-10 06:19:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83996 to 49039. [2019-09-10 06:19:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49039 states. [2019-09-10 06:19:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49039 states to 49039 states and 72261 transitions. [2019-09-10 06:19:22,617 INFO L78 Accepts]: Start accepts. Automaton has 49039 states and 72261 transitions. Word has length 254 [2019-09-10 06:19:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:22,617 INFO L475 AbstractCegarLoop]: Abstraction has 49039 states and 72261 transitions. [2019-09-10 06:19:22,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 49039 states and 72261 transitions. [2019-09-10 06:19:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 06:19:22,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:22,670 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] [2019-09-10 06:19:22,671 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash -140603661, now seen corresponding path program 1 times [2019-09-10 06:19:22,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:22,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:23,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:23,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:23,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:23,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:23,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:23,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:23,136 INFO L87 Difference]: Start difference. First operand 49039 states and 72261 transitions. Second operand 4 states. [2019-09-10 06:19:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:23,482 INFO L93 Difference]: Finished difference Result 90834 states and 132769 transitions. [2019-09-10 06:19:23,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:23,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-09-10 06:19:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:23,605 INFO L225 Difference]: With dead ends: 90834 [2019-09-10 06:19:23,606 INFO L226 Difference]: Without dead ends: 90834 [2019-09-10 06:19:23,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90834 states. [2019-09-10 06:19:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90834 to 90817. [2019-09-10 06:19:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90817 states. [2019-09-10 06:19:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90817 states to 90817 states and 132750 transitions. [2019-09-10 06:19:26,174 INFO L78 Accepts]: Start accepts. Automaton has 90817 states and 132750 transitions. Word has length 255 [2019-09-10 06:19:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:26,174 INFO L475 AbstractCegarLoop]: Abstraction has 90817 states and 132750 transitions. [2019-09-10 06:19:26,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 90817 states and 132750 transitions. [2019-09-10 06:19:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 06:19:26,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:26,251 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] [2019-09-10 06:19:26,251 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -731068887, now seen corresponding path program 1 times [2019-09-10 06:19:26,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:26,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:26,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:26,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:26,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:26,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:26,443 INFO L87 Difference]: Start difference. First operand 90817 states and 132750 transitions. Second operand 3 states. [2019-09-10 06:19:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:27,388 INFO L93 Difference]: Finished difference Result 177313 states and 256899 transitions. [2019-09-10 06:19:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:27,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 06:19:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:27,575 INFO L225 Difference]: With dead ends: 177313 [2019-09-10 06:19:27,576 INFO L226 Difference]: Without dead ends: 177313 [2019-09-10 06:19:27,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177313 states. [2019-09-10 06:19:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177313 to 176994. [2019-09-10 06:19:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176994 states. [2019-09-10 06:19:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176994 states to 176994 states and 256504 transitions. [2019-09-10 06:19:31,420 INFO L78 Accepts]: Start accepts. Automaton has 176994 states and 256504 transitions. Word has length 256 [2019-09-10 06:19:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:31,421 INFO L475 AbstractCegarLoop]: Abstraction has 176994 states and 256504 transitions. [2019-09-10 06:19:31,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 176994 states and 256504 transitions. [2019-09-10 06:19:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 06:19:31,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:31,567 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] [2019-09-10 06:19:31,567 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash -471280969, now seen corresponding path program 1 times [2019-09-10 06:19:31,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:31,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:31,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:31,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:31,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:31,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:31,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:31,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:31,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:31,835 INFO L87 Difference]: Start difference. First operand 176994 states and 256504 transitions. Second operand 4 states. [2019-09-10 06:19:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:32,361 INFO L93 Difference]: Finished difference Result 173608 states and 252394 transitions. [2019-09-10 06:19:32,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:32,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-09-10 06:19:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:32,500 INFO L225 Difference]: With dead ends: 173608 [2019-09-10 06:19:32,500 INFO L226 Difference]: Without dead ends: 157427 [2019-09-10 06:19:32,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157427 states. [2019-09-10 06:19:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157427 to 156209. [2019-09-10 06:19:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156209 states. [2019-09-10 06:19:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156209 states to 156209 states and 226245 transitions. [2019-09-10 06:19:37,053 INFO L78 Accepts]: Start accepts. Automaton has 156209 states and 226245 transitions. Word has length 257 [2019-09-10 06:19:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:37,053 INFO L475 AbstractCegarLoop]: Abstraction has 156209 states and 226245 transitions. [2019-09-10 06:19:37,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 156209 states and 226245 transitions. [2019-09-10 06:19:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 06:19:37,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:37,162 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] [2019-09-10 06:19:37,162 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1639922080, now seen corresponding path program 1 times [2019-09-10 06:19:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:37,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:37,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:37,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:37,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:37,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:37,357 INFO L87 Difference]: Start difference. First operand 156209 states and 226245 transitions. Second operand 3 states. [2019-09-10 06:19:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:38,025 INFO L93 Difference]: Finished difference Result 305748 states and 439209 transitions. [2019-09-10 06:19:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:38,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-10 06:19:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:38,381 INFO L225 Difference]: With dead ends: 305748 [2019-09-10 06:19:38,381 INFO L226 Difference]: Without dead ends: 305748 [2019-09-10 06:19:38,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305748 states. [2019-09-10 06:19:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305748 to 305735. [2019-09-10 06:19:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305735 states. [2019-09-10 06:19:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305735 states to 305735 states and 439198 transitions. [2019-09-10 06:19:45,922 INFO L78 Accepts]: Start accepts. Automaton has 305735 states and 439198 transitions. Word has length 259 [2019-09-10 06:19:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:45,922 INFO L475 AbstractCegarLoop]: Abstraction has 305735 states and 439198 transitions. [2019-09-10 06:19:45,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 305735 states and 439198 transitions. [2019-09-10 06:19:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 06:19:46,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:46,147 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] [2019-09-10 06:19:46,147 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash -348122397, now seen corresponding path program 1 times [2019-09-10 06:19:46,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:46,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:46,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:46,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:46,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:46,423 INFO L87 Difference]: Start difference. First operand 305735 states and 439198 transitions. Second operand 4 states. [2019-09-10 06:19:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:48,603 INFO L93 Difference]: Finished difference Result 460926 states and 659384 transitions. [2019-09-10 06:19:48,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:48,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-10 06:19:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:49,141 INFO L225 Difference]: With dead ends: 460926 [2019-09-10 06:19:49,141 INFO L226 Difference]: Without dead ends: 458910 [2019-09-10 06:19:49,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:19:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458910 states. [2019-09-10 06:19:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458910 to 293085. [2019-09-10 06:19:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293085 states. [2019-09-10 06:19:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293085 states to 293085 states and 420992 transitions. [2019-09-10 06:19:58,265 INFO L78 Accepts]: Start accepts. Automaton has 293085 states and 420992 transitions. Word has length 259 [2019-09-10 06:19:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:58,266 INFO L475 AbstractCegarLoop]: Abstraction has 293085 states and 420992 transitions. [2019-09-10 06:19:58,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 293085 states and 420992 transitions. [2019-09-10 06:19:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 06:19:58,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:58,483 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] [2019-09-10 06:19:58,483 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1767806559, now seen corresponding path program 1 times [2019-09-10 06:19:58,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:58,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:58,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:58,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:58,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:58,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:58,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:58,603 INFO L87 Difference]: Start difference. First operand 293085 states and 420992 transitions. Second operand 3 states. [2019-09-10 06:20:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:00,898 INFO L93 Difference]: Finished difference Result 486472 states and 695009 transitions. [2019-09-10 06:20:00,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:00,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 06:20:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:01,598 INFO L225 Difference]: With dead ends: 486472 [2019-09-10 06:20:01,598 INFO L226 Difference]: Without dead ends: 486472 [2019-09-10 06:20:01,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486472 states. [2019-09-10 06:20:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486472 to 292545. [2019-09-10 06:20:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292545 states. [2019-09-10 06:20:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292545 states to 292545 states and 419394 transitions. [2019-09-10 06:20:11,680 INFO L78 Accepts]: Start accepts. Automaton has 292545 states and 419394 transitions. Word has length 262 [2019-09-10 06:20:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:11,680 INFO L475 AbstractCegarLoop]: Abstraction has 292545 states and 419394 transitions. [2019-09-10 06:20:11,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 292545 states and 419394 transitions. [2019-09-10 06:20:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 06:20:11,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:11,889 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] [2019-09-10 06:20:11,889 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1103029111, now seen corresponding path program 1 times [2019-09-10 06:20:11,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:11,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:11,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:11,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:11,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:12,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:12,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:12,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:12,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:12,163 INFO L87 Difference]: Start difference. First operand 292545 states and 419394 transitions. Second operand 4 states. [2019-09-10 06:20:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:12,902 INFO L93 Difference]: Finished difference Result 290698 states and 417861 transitions. [2019-09-10 06:20:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:12,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-09-10 06:20:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:13,180 INFO L225 Difference]: With dead ends: 290698 [2019-09-10 06:20:13,180 INFO L226 Difference]: Without dead ends: 268900 [2019-09-10 06:20:13,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268900 states. [2019-09-10 06:20:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268900 to 265622. [2019-09-10 06:20:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265622 states. [2019-09-10 06:20:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265622 states to 265622 states and 380566 transitions. [2019-09-10 06:20:22,532 INFO L78 Accepts]: Start accepts. Automaton has 265622 states and 380566 transitions. Word has length 263 [2019-09-10 06:20:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:22,532 INFO L475 AbstractCegarLoop]: Abstraction has 265622 states and 380566 transitions. [2019-09-10 06:20:22,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 265622 states and 380566 transitions. [2019-09-10 06:20:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 06:20:22,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:22,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:22,731 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1317852449, now seen corresponding path program 1 times [2019-09-10 06:20:22,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:22,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:22,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:23,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:23,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:23,074 INFO L87 Difference]: Start difference. First operand 265622 states and 380566 transitions. Second operand 4 states. [2019-09-10 06:20:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:25,151 INFO L93 Difference]: Finished difference Result 516198 states and 731856 transitions. [2019-09-10 06:20:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:25,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-09-10 06:20:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:25,738 INFO L225 Difference]: With dead ends: 516198 [2019-09-10 06:20:25,739 INFO L226 Difference]: Without dead ends: 516198 [2019-09-10 06:20:25,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516198 states. [2019-09-10 06:20:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516198 to 514325. [2019-09-10 06:20:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514325 states. [2019-09-10 06:20:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514325 states to 514325 states and 729290 transitions. [2019-09-10 06:20:38,344 INFO L78 Accepts]: Start accepts. Automaton has 514325 states and 729290 transitions. Word has length 263 [2019-09-10 06:20:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:38,345 INFO L475 AbstractCegarLoop]: Abstraction has 514325 states and 729290 transitions. [2019-09-10 06:20:38,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 514325 states and 729290 transitions. [2019-09-10 06:20:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 06:20:39,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:39,997 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] [2019-09-10 06:20:39,998 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash 971711623, now seen corresponding path program 1 times [2019-09-10 06:20:39,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:39,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:40,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:40,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:40,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:40,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:40,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:40,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:40,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:40,101 INFO L87 Difference]: Start difference. First operand 514325 states and 729290 transitions. Second operand 3 states. [2019-09-10 06:20:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:43,849 INFO L93 Difference]: Finished difference Result 989445 states and 1399084 transitions. [2019-09-10 06:20:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:43,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 06:20:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:45,068 INFO L225 Difference]: With dead ends: 989445 [2019-09-10 06:20:45,068 INFO L226 Difference]: Without dead ends: 989445 [2019-09-10 06:20:45,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989445 states. [2019-09-10 06:21:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989445 to 508551. [2019-09-10 06:21:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508551 states. [2019-09-10 06:21:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508551 states to 508551 states and 720381 transitions. [2019-09-10 06:21:04,584 INFO L78 Accepts]: Start accepts. Automaton has 508551 states and 720381 transitions. Word has length 265 [2019-09-10 06:21:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:04,584 INFO L475 AbstractCegarLoop]: Abstraction has 508551 states and 720381 transitions. [2019-09-10 06:21:04,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 508551 states and 720381 transitions. [2019-09-10 06:21:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 06:21:04,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:04,997 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] [2019-09-10 06:21:04,997 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1231494676, now seen corresponding path program 1 times [2019-09-10 06:21:04,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:04,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:04,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:04,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:04,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:05,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:05,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:05,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:05,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:05,197 INFO L87 Difference]: Start difference. First operand 508551 states and 720381 transitions. Second operand 3 states. [2019-09-10 06:21:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:13,392 INFO L93 Difference]: Finished difference Result 998204 states and 1401289 transitions. [2019-09-10 06:21:13,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:13,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 06:21:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:14,506 INFO L225 Difference]: With dead ends: 998204 [2019-09-10 06:21:14,507 INFO L226 Difference]: Without dead ends: 998204 [2019-09-10 06:21:14,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998204 states. [2019-09-10 06:21:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998204 to 996331. [2019-09-10 06:21:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996331 states. [2019-09-10 06:21:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996331 states to 996331 states and 1398723 transitions. [2019-09-10 06:21:45,793 INFO L78 Accepts]: Start accepts. Automaton has 996331 states and 1398723 transitions. Word has length 265 [2019-09-10 06:21:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:45,794 INFO L475 AbstractCegarLoop]: Abstraction has 996331 states and 1398723 transitions. [2019-09-10 06:21:45,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 996331 states and 1398723 transitions. [2019-09-10 06:21:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 06:21:48,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:48,990 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] [2019-09-10 06:21:48,990 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash -850189880, now seen corresponding path program 1 times [2019-09-10 06:21:48,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:48,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:48,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:49,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 06:21:49,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:49,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:49,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:49,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:49,087 INFO L87 Difference]: Start difference. First operand 996331 states and 1398723 transitions. Second operand 3 states. [2019-09-10 06:22:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:07,701 INFO L93 Difference]: Finished difference Result 1962771 states and 2752850 transitions. [2019-09-10 06:22:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:07,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-09-10 06:22:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:11,738 INFO L225 Difference]: With dead ends: 1962771 [2019-09-10 06:22:11,738 INFO L226 Difference]: Without dead ends: 1962771 [2019-09-10 06:22:11,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962771 states. [2019-09-10 06:22:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962771 to 996986. [2019-09-10 06:22:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996986 states. [2019-09-10 06:22:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996986 states to 996986 states and 1399472 transitions. [2019-09-10 06:22:55,263 INFO L78 Accepts]: Start accepts. Automaton has 996986 states and 1399472 transitions. Word has length 266 [2019-09-10 06:22:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:55,263 INFO L475 AbstractCegarLoop]: Abstraction has 996986 states and 1399472 transitions. [2019-09-10 06:22:55,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 996986 states and 1399472 transitions. [2019-09-10 06:22:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 06:22:56,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:56,102 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] [2019-09-10 06:22:56,102 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash -116788239, now seen corresponding path program 1 times [2019-09-10 06:22:56,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:56,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:58,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:58,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:58,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:58,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:58,142 INFO L87 Difference]: Start difference. First operand 996986 states and 1399472 transitions. Second operand 3 states.