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.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:33:22,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:33:22,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:33:22,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:33:22,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:33:22,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:33:22,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:33:22,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:33:22,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:33:22,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:33:22,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:33:22,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:33:22,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:33:22,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:33:22,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:33:22,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:33:22,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:33:22,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:33:22,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:33:22,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:33:22,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:33:22,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:33:22,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:33:22,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:33:22,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:33:22,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:33:22,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:33:22,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:33:22,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:33:22,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:33:22,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:33:22,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:33:22,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:33:22,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:33:22,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:33:22,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:33:22,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:33:22,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:33:22,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:33:22,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:33:22,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:33:22,126 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:33:22,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:33:22,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:33:22,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:33:22,146 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:33:22,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:33:22,147 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:33:22,148 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:33:22,148 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:33:22,148 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:33:22,149 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:33:22,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:33:22,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:33:22,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:33:22,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:33:22,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:33:22,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:33:22,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:33:22,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:33:22,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:33:22,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:33:22,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:33:22,154 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:33:22,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:33:22,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:33:22,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:33:22,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:33:22,155 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:33:22,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:33:22,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:33:22,155 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:33:22,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:33:22,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:33:22,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:33:22,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:33:22,218 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:33:22,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 06:33:22,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad2555b7/96481ef6304d4974b054b78816650955/FLAGd15ba4c3e [2019-09-10 06:33:23,033 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:33:23,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 06:33:23,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad2555b7/96481ef6304d4974b054b78816650955/FLAGd15ba4c3e [2019-09-10 06:33:23,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad2555b7/96481ef6304d4974b054b78816650955 [2019-09-10 06:33:23,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:33:23,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:33:23,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:23,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:33:23,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:33:23,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:23" (1/1) ... [2019-09-10 06:33:23,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541e676b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:23, skipping insertion in model container [2019-09-10 06:33:23,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:23" (1/1) ... [2019-09-10 06:33:23,179 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:33:23,432 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:33:25,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:25,580 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:33:27,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:27,350 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:33:27,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27 WrapperNode [2019-09-10 06:33:27,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:27,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:33:27,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:33:27,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:33:27,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (1/1) ... [2019-09-10 06:33:27,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:33:27,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:33:27,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:33:27,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:33:27,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (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:33:27,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:33:27,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:33:27,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:33:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:33:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:33:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:33:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:33:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:33:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:33:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:33:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:33:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:33:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:33:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:33:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:33:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:33:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:33:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:33:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:33:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:33:34,957 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:33:34,958 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:33:34,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:34 BoogieIcfgContainer [2019-09-10 06:33:34,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:33:34,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:33:34,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:33:34,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:33:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:33:23" (1/3) ... [2019-09-10 06:33:34,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fc089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:34, skipping insertion in model container [2019-09-10 06:33:34,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:27" (2/3) ... [2019-09-10 06:33:34,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fc089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:34, skipping insertion in model container [2019-09-10 06:33:34,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:34" (3/3) ... [2019-09-10 06:33:34,979 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 06:33:34,992 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:33:35,022 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:33:35,043 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:33:35,078 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:33:35,078 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:33:35,078 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:33:35,079 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:33:35,079 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:33:35,079 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:33:35,079 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:33:35,079 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:33:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states. [2019-09-10 06:33:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:33:35,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:35,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:35,264 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:35,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1861550886, now seen corresponding path program 1 times [2019-09-10 06:33:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:35,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:35,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:36,250 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:33:36,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:36,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:36,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:36,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:36,278 INFO L87 Difference]: Start difference. First operand 2249 states. Second operand 4 states. [2019-09-10 06:33:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:36,651 INFO L93 Difference]: Finished difference Result 2255 states and 3956 transitions. [2019-09-10 06:33:36,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:33:36,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-09-10 06:33:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:36,694 INFO L225 Difference]: With dead ends: 2255 [2019-09-10 06:33:36,694 INFO L226 Difference]: Without dead ends: 2245 [2019-09-10 06:33:36,698 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:33:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-09-10 06:33:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2019-09-10 06:33:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-09-10 06:33:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3871 transitions. [2019-09-10 06:33:36,840 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3871 transitions. Word has length 290 [2019-09-10 06:33:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:36,843 INFO L475 AbstractCegarLoop]: Abstraction has 2245 states and 3871 transitions. [2019-09-10 06:33:36,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3871 transitions. [2019-09-10 06:33:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-10 06:33:36,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:36,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:36,857 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1372017418, now seen corresponding path program 1 times [2019-09-10 06:33:36,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:36,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:36,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:36,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:37,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:37,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:37,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:37,315 INFO L87 Difference]: Start difference. First operand 2245 states and 3871 transitions. Second operand 3 states. [2019-09-10 06:33:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:37,948 INFO L93 Difference]: Finished difference Result 3801 states and 6466 transitions. [2019-09-10 06:33:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:37,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2019-09-10 06:33:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:37,982 INFO L225 Difference]: With dead ends: 3801 [2019-09-10 06:33:37,982 INFO L226 Difference]: Without dead ends: 3801 [2019-09-10 06:33:37,988 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:33:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-09-10 06:33:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3797. [2019-09-10 06:33:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-09-10 06:33:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 6464 transitions. [2019-09-10 06:33:38,138 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 6464 transitions. Word has length 349 [2019-09-10 06:33:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:38,142 INFO L475 AbstractCegarLoop]: Abstraction has 3797 states and 6464 transitions. [2019-09-10 06:33:38,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 6464 transitions. [2019-09-10 06:33:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-10 06:33:38,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:38,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:38,171 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash -58772868, now seen corresponding path program 1 times [2019-09-10 06:33:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:38,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:38,588 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:33:38,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:38,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:38,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:38,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:38,591 INFO L87 Difference]: Start difference. First operand 3797 states and 6464 transitions. Second operand 3 states. [2019-09-10 06:33:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:38,749 INFO L93 Difference]: Finished difference Result 4697 states and 7998 transitions. [2019-09-10 06:33:38,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:38,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-09-10 06:33:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:38,772 INFO L225 Difference]: With dead ends: 4697 [2019-09-10 06:33:38,772 INFO L226 Difference]: Without dead ends: 4697 [2019-09-10 06:33:38,773 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:33:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2019-09-10 06:33:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4693. [2019-09-10 06:33:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4693 states. [2019-09-10 06:33:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4693 states to 4693 states and 7996 transitions. [2019-09-10 06:33:38,869 INFO L78 Accepts]: Start accepts. Automaton has 4693 states and 7996 transitions. Word has length 353 [2019-09-10 06:33:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:38,869 INFO L475 AbstractCegarLoop]: Abstraction has 4693 states and 7996 transitions. [2019-09-10 06:33:38,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4693 states and 7996 transitions. [2019-09-10 06:33:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-10 06:33:38,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:38,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:38,886 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash -691547991, now seen corresponding path program 1 times [2019-09-10 06:33:38,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:39,252 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:33:39,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:39,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:39,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:39,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:39,255 INFO L87 Difference]: Start difference. First operand 4693 states and 7996 transitions. Second operand 3 states. [2019-09-10 06:33:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:39,452 INFO L93 Difference]: Finished difference Result 8527 states and 14423 transitions. [2019-09-10 06:33:39,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:39,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-09-10 06:33:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:39,491 INFO L225 Difference]: With dead ends: 8527 [2019-09-10 06:33:39,492 INFO L226 Difference]: Without dead ends: 8527 [2019-09-10 06:33:39,492 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:33:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8527 states. [2019-09-10 06:33:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8527 to 8523. [2019-09-10 06:33:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8523 states. [2019-09-10 06:33:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 14421 transitions. [2019-09-10 06:33:39,685 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 14421 transitions. Word has length 357 [2019-09-10 06:33:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:39,686 INFO L475 AbstractCegarLoop]: Abstraction has 8523 states and 14421 transitions. [2019-09-10 06:33:39,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 14421 transitions. [2019-09-10 06:33:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-10 06:33:39,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:39,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:39,710 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash 127920415, now seen corresponding path program 1 times [2019-09-10 06:33:39,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:39,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:39,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:40,078 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:33:40,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:40,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:40,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:40,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:40,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:40,081 INFO L87 Difference]: Start difference. First operand 8523 states and 14421 transitions. Second operand 3 states. [2019-09-10 06:33:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:40,347 INFO L93 Difference]: Finished difference Result 11190 states and 18933 transitions. [2019-09-10 06:33:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:40,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 361 [2019-09-10 06:33:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:40,425 INFO L225 Difference]: With dead ends: 11190 [2019-09-10 06:33:40,426 INFO L226 Difference]: Without dead ends: 11190 [2019-09-10 06:33:40,427 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:33:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2019-09-10 06:33:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11186. [2019-09-10 06:33:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11186 states. [2019-09-10 06:33:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11186 states to 11186 states and 18931 transitions. [2019-09-10 06:33:40,753 INFO L78 Accepts]: Start accepts. Automaton has 11186 states and 18931 transitions. Word has length 361 [2019-09-10 06:33:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:40,754 INFO L475 AbstractCegarLoop]: Abstraction has 11186 states and 18931 transitions. [2019-09-10 06:33:40,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11186 states and 18931 transitions. [2019-09-10 06:33:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 06:33:40,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:40,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:40,786 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1382676078, now seen corresponding path program 1 times [2019-09-10 06:33:40,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:40,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:41,125 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:33:41,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:41,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:41,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:41,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:41,128 INFO L87 Difference]: Start difference. First operand 11186 states and 18931 transitions. Second operand 3 states. [2019-09-10 06:33:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:41,373 INFO L93 Difference]: Finished difference Result 21006 states and 35290 transitions. [2019-09-10 06:33:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:41,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-09-10 06:33:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:41,425 INFO L225 Difference]: With dead ends: 21006 [2019-09-10 06:33:41,425 INFO L226 Difference]: Without dead ends: 21006 [2019-09-10 06:33:41,426 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:33:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21006 states. [2019-09-10 06:33:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21006 to 21002. [2019-09-10 06:33:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21002 states. [2019-09-10 06:33:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21002 states to 21002 states and 35288 transitions. [2019-09-10 06:33:42,646 INFO L78 Accepts]: Start accepts. Automaton has 21002 states and 35288 transitions. Word has length 365 [2019-09-10 06:33:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:42,648 INFO L475 AbstractCegarLoop]: Abstraction has 21002 states and 35288 transitions. [2019-09-10 06:33:42,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 21002 states and 35288 transitions. [2019-09-10 06:33:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-10 06:33:42,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:42,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:42,698 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1632761396, now seen corresponding path program 1 times [2019-09-10 06:33:42,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:42,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:42,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:43,017 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:33:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:43,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:43,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:43,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:43,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:43,020 INFO L87 Difference]: Start difference. First operand 21002 states and 35288 transitions. Second operand 3 states. [2019-09-10 06:33:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:43,244 INFO L93 Difference]: Finished difference Result 28235 states and 47448 transitions. [2019-09-10 06:33:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:43,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 369 [2019-09-10 06:33:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:43,309 INFO L225 Difference]: With dead ends: 28235 [2019-09-10 06:33:43,309 INFO L226 Difference]: Without dead ends: 28235 [2019-09-10 06:33:43,309 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:33:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28235 states. [2019-09-10 06:33:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28235 to 28231. [2019-09-10 06:33:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28231 states. [2019-09-10 06:33:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28231 states to 28231 states and 47446 transitions. [2019-09-10 06:33:43,776 INFO L78 Accepts]: Start accepts. Automaton has 28231 states and 47446 transitions. Word has length 369 [2019-09-10 06:33:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:43,777 INFO L475 AbstractCegarLoop]: Abstraction has 28231 states and 47446 transitions. [2019-09-10 06:33:43,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 28231 states and 47446 transitions. [2019-09-10 06:33:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:33:43,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:43,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:43,845 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2014350559, now seen corresponding path program 1 times [2019-09-10 06:33:43,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:43,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:43,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:43,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:44,412 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:33:44,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:44,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:44,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:44,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:44,414 INFO L87 Difference]: Start difference. First operand 28231 states and 47446 transitions. Second operand 3 states. [2019-09-10 06:33:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:44,773 INFO L93 Difference]: Finished difference Result 53643 states and 89425 transitions. [2019-09-10 06:33:44,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:44,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-10 06:33:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:44,912 INFO L225 Difference]: With dead ends: 53643 [2019-09-10 06:33:44,913 INFO L226 Difference]: Without dead ends: 53643 [2019-09-10 06:33:44,913 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:33:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53643 states. [2019-09-10 06:33:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53643 to 53639. [2019-09-10 06:33:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53639 states. [2019-09-10 06:33:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53639 states to 53639 states and 89423 transitions. [2019-09-10 06:33:45,794 INFO L78 Accepts]: Start accepts. Automaton has 53639 states and 89423 transitions. Word has length 373 [2019-09-10 06:33:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 53639 states and 89423 transitions. [2019-09-10 06:33:45,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 53639 states and 89423 transitions. [2019-09-10 06:33:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-10 06:33:45,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:45,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:45,854 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1625799271, now seen corresponding path program 1 times [2019-09-10 06:33:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:45,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:45,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:47,203 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:33:47,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:47,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:47,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:47,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:47,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:47,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:47,206 INFO L87 Difference]: Start difference. First operand 53639 states and 89423 transitions. Second operand 3 states. [2019-09-10 06:33:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:47,642 INFO L93 Difference]: Finished difference Result 72420 states and 120711 transitions. [2019-09-10 06:33:47,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:47,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-09-10 06:33:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:47,808 INFO L225 Difference]: With dead ends: 72420 [2019-09-10 06:33:47,808 INFO L226 Difference]: Without dead ends: 72420 [2019-09-10 06:33:47,809 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:33:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72420 states. [2019-09-10 06:33:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72420 to 72416. [2019-09-10 06:33:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72416 states. [2019-09-10 06:33:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72416 states to 72416 states and 120709 transitions. [2019-09-10 06:33:48,712 INFO L78 Accepts]: Start accepts. Automaton has 72416 states and 120709 transitions. Word has length 377 [2019-09-10 06:33:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:48,713 INFO L475 AbstractCegarLoop]: Abstraction has 72416 states and 120709 transitions. [2019-09-10 06:33:48,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 72416 states and 120709 transitions. [2019-09-10 06:33:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-10 06:33:48,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:48,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:48,795 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash 58024986, now seen corresponding path program 1 times [2019-09-10 06:33:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:48,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:48,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:49,354 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:33:49,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:49,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:49,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:49,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:49,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:49,357 INFO L87 Difference]: Start difference. First operand 72416 states and 120709 transitions. Second operand 3 states. [2019-09-10 06:33:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:50,265 INFO L93 Difference]: Finished difference Result 137744 states and 227424 transitions. [2019-09-10 06:33:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:50,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-09-10 06:33:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:50,473 INFO L225 Difference]: With dead ends: 137744 [2019-09-10 06:33:50,473 INFO L226 Difference]: Without dead ends: 137744 [2019-09-10 06:33:50,474 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:33:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137744 states. [2019-09-10 06:33:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137744 to 137740. [2019-09-10 06:33:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137740 states. [2019-09-10 06:33:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137740 states to 137740 states and 227422 transitions. [2019-09-10 06:33:54,685 INFO L78 Accepts]: Start accepts. Automaton has 137740 states and 227422 transitions. Word has length 381 [2019-09-10 06:33:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:54,686 INFO L475 AbstractCegarLoop]: Abstraction has 137740 states and 227422 transitions. [2019-09-10 06:33:54,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 137740 states and 227422 transitions. [2019-09-10 06:33:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-10 06:33:54,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:54,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:54,810 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1546574356, now seen corresponding path program 1 times [2019-09-10 06:33:54,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:54,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:55,094 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:33:55,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:55,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:55,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:55,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:55,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:55,096 INFO L87 Difference]: Start difference. First operand 137740 states and 227422 transitions. Second operand 3 states. [2019-09-10 06:33:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:57,909 INFO L93 Difference]: Finished difference Result 184737 states and 304690 transitions. [2019-09-10 06:33:57,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:57,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 385 [2019-09-10 06:33:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:58,092 INFO L225 Difference]: With dead ends: 184737 [2019-09-10 06:33:58,092 INFO L226 Difference]: Without dead ends: 184737 [2019-09-10 06:33:58,093 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:33:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184737 states. [2019-09-10 06:33:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184737 to 184733. [2019-09-10 06:33:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184733 states. [2019-09-10 06:34:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184733 states to 184733 states and 304688 transitions. [2019-09-10 06:34:00,092 INFO L78 Accepts]: Start accepts. Automaton has 184733 states and 304688 transitions. Word has length 385 [2019-09-10 06:34:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:00,093 INFO L475 AbstractCegarLoop]: Abstraction has 184733 states and 304688 transitions. [2019-09-10 06:34:00,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:34:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 184733 states and 304688 transitions. [2019-09-10 06:34:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-10 06:34:00,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:00,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:00,210 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash 426553753, now seen corresponding path program 1 times [2019-09-10 06:34:00,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:00,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:00,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:01,155 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:34:01,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:01,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:01,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:01,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:01,157 INFO L87 Difference]: Start difference. First operand 184733 states and 304688 transitions. Second operand 7 states. [2019-09-10 06:34:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:10,501 INFO L93 Difference]: Finished difference Result 1186396 states and 1964045 transitions. [2019-09-10 06:34:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:34:10,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 389 [2019-09-10 06:34:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:12,436 INFO L225 Difference]: With dead ends: 1186396 [2019-09-10 06:34:12,436 INFO L226 Difference]: Without dead ends: 1186396 [2019-09-10 06:34:12,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:34:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186396 states. [2019-09-10 06:34:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186396 to 367634. [2019-09-10 06:34:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367634 states. [2019-09-10 06:34:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367634 states to 367634 states and 603488 transitions. [2019-09-10 06:34:38,263 INFO L78 Accepts]: Start accepts. Automaton has 367634 states and 603488 transitions. Word has length 389 [2019-09-10 06:34:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:38,264 INFO L475 AbstractCegarLoop]: Abstraction has 367634 states and 603488 transitions. [2019-09-10 06:34:38,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:34:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 367634 states and 603488 transitions. [2019-09-10 06:34:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 06:34:38,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:38,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:38,512 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:38,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1426895631, now seen corresponding path program 1 times [2019-09-10 06:34:38,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:38,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:34:38,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:34:38,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:38,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:34:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:34:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:34:38,808 INFO L87 Difference]: Start difference. First operand 367634 states and 603488 transitions. Second operand 4 states. [2019-09-10 06:34:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:43,158 INFO L93 Difference]: Finished difference Result 727181 states and 1198564 transitions. [2019-09-10 06:34:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:34:43,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-10 06:34:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:44,127 INFO L225 Difference]: With dead ends: 727181 [2019-09-10 06:34:44,127 INFO L226 Difference]: Without dead ends: 727181 [2019-09-10 06:34:44,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:34:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727181 states. [2019-09-10 06:34:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727181 to 607029. [2019-09-10 06:34:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607029 states. [2019-09-10 06:35:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607029 states to 607029 states and 997448 transitions. [2019-09-10 06:35:00,254 INFO L78 Accepts]: Start accepts. Automaton has 607029 states and 997448 transitions. Word has length 391 [2019-09-10 06:35:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:00,255 INFO L475 AbstractCegarLoop]: Abstraction has 607029 states and 997448 transitions. [2019-09-10 06:35:00,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:35:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 607029 states and 997448 transitions. [2019-09-10 06:35:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 06:35:00,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:00,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:00,874 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash -258916304, now seen corresponding path program 1 times [2019-09-10 06:35:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:00,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:00,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:10,091 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:35:10,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:10,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:35:10,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:10,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:35:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:35:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:35:10,094 INFO L87 Difference]: Start difference. First operand 607029 states and 997448 transitions. Second operand 4 states. [2019-09-10 06:35:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:14,365 INFO L93 Difference]: Finished difference Result 1192930 states and 1960200 transitions. [2019-09-10 06:35:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:35:14,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 392 [2019-09-10 06:35:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:24,095 INFO L225 Difference]: With dead ends: 1192930 [2019-09-10 06:35:24,095 INFO L226 Difference]: Without dead ends: 1192930 [2019-09-10 06:35:24,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:35:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192930 states. [2019-09-10 06:35:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192930 to 997850. [2019-09-10 06:35:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997850 states. [2019-09-10 06:35:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997850 states to 997850 states and 1635986 transitions. [2019-09-10 06:35:50,272 INFO L78 Accepts]: Start accepts. Automaton has 997850 states and 1635986 transitions. Word has length 392 [2019-09-10 06:35:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:50,272 INFO L475 AbstractCegarLoop]: Abstraction has 997850 states and 1635986 transitions. [2019-09-10 06:35:50,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:35:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 997850 states and 1635986 transitions. [2019-09-10 06:35:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-10 06:35:51,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:51,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:51,071 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 488934634, now seen corresponding path program 1 times [2019-09-10 06:35:51,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:51,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:51,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:51,339 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:35:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:35:51,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:51,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:35:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:35:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:35:51,341 INFO L87 Difference]: Start difference. First operand 997850 states and 1635986 transitions. Second operand 4 states. [2019-09-10 06:36:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:10,593 INFO L93 Difference]: Finished difference Result 1949245 states and 3195914 transitions. [2019-09-10 06:36:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:36:10,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-09-10 06:36:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:14,749 INFO L225 Difference]: With dead ends: 1949245 [2019-09-10 06:36:14,750 INFO L226 Difference]: Without dead ends: 1949245 [2019-09-10 06:36:14,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:36:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949245 states. [2019-09-10 06:37:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949245 to 1634519. [2019-09-10 06:37:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634519 states.