java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:56:26,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:56:26,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:56:26,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:56:26,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:56:26,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:56:26,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:56:26,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:56:26,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:56:26,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:56:26,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:56:26,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:56:26,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:56:26,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:56:26,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:56:26,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:56:26,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:56:26,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:56:26,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:56:26,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:56:26,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:56:26,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:56:26,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:56:26,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:56:26,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:56:26,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:56:26,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:56:26,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:56:26,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:56:26,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:56:26,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:56:26,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:56:26,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:56:26,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:56:26,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:56:26,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:56:26,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:56:26,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:56:26,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:56:26,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:56:26,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:56:26,172 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 08:56:26,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:56:26,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:56:26,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:56:26,200 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:56:26,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:56:26,201 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:56:26,201 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:56:26,202 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:56:26,202 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:56:26,205 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:56:26,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:56:26,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:56:26,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:56:26,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:56:26,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:56:26,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:56:26,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:56:26,208 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:56:26,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:56:26,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:56:26,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:56:26,209 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:56:26,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:56:26,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:56:26,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:56:26,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:56:26,211 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:56:26,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:56:26,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:56:26,212 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:56:26,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:56:26,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:56:26,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:56:26,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:56:26,294 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:56:26,295 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:56:26,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5620dac57/5d6beda6f8c542d89eead9ffcd8bf80c/FLAG2a19516de [2019-09-10 08:56:27,078 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:56:27,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:56:27,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5620dac57/5d6beda6f8c542d89eead9ffcd8bf80c/FLAG2a19516de [2019-09-10 08:56:27,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5620dac57/5d6beda6f8c542d89eead9ffcd8bf80c [2019-09-10 08:56:27,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:56:27,186 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:56:27,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:56:27,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:56:27,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:56:27,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:56:27" (1/1) ... [2019-09-10 08:56:27,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e1bcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:27, skipping insertion in model container [2019-09-10 08:56:27,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:56:27" (1/1) ... [2019-09-10 08:56:27,205 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:56:27,321 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:56:28,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:56:28,374 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:56:28,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:56:28,961 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:56:28,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28 WrapperNode [2019-09-10 08:56:28,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:56:28,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:56:28,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:56:28,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:56:28,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:28,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:29,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:29,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:29,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:29,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:29,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (1/1) ... [2019-09-10 08:56:29,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:56:29,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:56:29,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:56:29,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:56:29,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (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 08:56:29,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:56:29,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:56:29,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:56:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:56:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:56:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:56:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:56:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:56:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:56:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:56:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:56:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:56:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:56:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:56:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:56:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:56:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:56:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:56:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:56:32,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:56:32,068 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:56:32,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:56:32 BoogieIcfgContainer [2019-09-10 08:56:32,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:56:32,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:56:32,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:56:32,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:56:32,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:56:27" (1/3) ... [2019-09-10 08:56:32,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64195c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:56:32, skipping insertion in model container [2019-09-10 08:56:32,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:28" (2/3) ... [2019-09-10 08:56:32,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64195c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:56:32, skipping insertion in model container [2019-09-10 08:56:32,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:56:32" (3/3) ... [2019-09-10 08:56:32,077 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:56:32,086 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:56:32,095 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:56:32,111 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:56:32,137 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:56:32,137 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:56:32,137 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:56:32,137 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:56:32,137 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:56:32,138 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:56:32,138 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:56:32,138 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:56:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states. [2019-09-10 08:56:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:56:32,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:32,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:32,214 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash -990658724, now seen corresponding path program 1 times [2019-09-10 08:56:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:32,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:33,875 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 08:56:33,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:33,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:33,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:33,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:33,899 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 4 states. [2019-09-10 08:56:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:34,199 INFO L93 Difference]: Finished difference Result 1520 states and 2691 transitions. [2019-09-10 08:56:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:56:34,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 08:56:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:34,241 INFO L225 Difference]: With dead ends: 1520 [2019-09-10 08:56:34,241 INFO L226 Difference]: Without dead ends: 1512 [2019-09-10 08:56:34,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:56:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-09-10 08:56:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1510. [2019-09-10 08:56:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-09-10 08:56:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2348 transitions. [2019-09-10 08:56:34,392 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2348 transitions. Word has length 320 [2019-09-10 08:56:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:34,393 INFO L475 AbstractCegarLoop]: Abstraction has 1510 states and 2348 transitions. [2019-09-10 08:56:34,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2348 transitions. [2019-09-10 08:56:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:56:34,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:34,405 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] [2019-09-10 08:56:34,405 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2068718213, now seen corresponding path program 1 times [2019-09-10 08:56:34,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:34,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:34,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:34,902 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 08:56:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:34,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:34,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:34,911 INFO L87 Difference]: Start difference. First operand 1510 states and 2348 transitions. Second operand 3 states. [2019-09-10 08:56:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:35,070 INFO L93 Difference]: Finished difference Result 2958 states and 4574 transitions. [2019-09-10 08:56:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:35,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:56:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:35,089 INFO L225 Difference]: With dead ends: 2958 [2019-09-10 08:56:35,089 INFO L226 Difference]: Without dead ends: 2958 [2019-09-10 08:56:35,090 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 08:56:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-09-10 08:56:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2956. [2019-09-10 08:56:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-09-10 08:56:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4573 transitions. [2019-09-10 08:56:35,177 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4573 transitions. Word has length 322 [2019-09-10 08:56:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:35,178 INFO L475 AbstractCegarLoop]: Abstraction has 2956 states and 4573 transitions. [2019-09-10 08:56:35,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4573 transitions. [2019-09-10 08:56:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:56:35,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:35,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:35,191 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1725739904, now seen corresponding path program 1 times [2019-09-10 08:56:35,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:35,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:35,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:35,344 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 08:56:35,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:35,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:35,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:35,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:35,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:35,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:35,347 INFO L87 Difference]: Start difference. First operand 2956 states and 4573 transitions. Second operand 3 states. [2019-09-10 08:56:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:35,427 INFO L93 Difference]: Finished difference Result 5879 states and 9086 transitions. [2019-09-10 08:56:35,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:35,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:56:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:35,463 INFO L225 Difference]: With dead ends: 5879 [2019-09-10 08:56:35,463 INFO L226 Difference]: Without dead ends: 5879 [2019-09-10 08:56:35,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2019-09-10 08:56:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 2975. [2019-09-10 08:56:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-09-10 08:56:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4601 transitions. [2019-09-10 08:56:35,598 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4601 transitions. Word has length 322 [2019-09-10 08:56:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:35,599 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4601 transitions. [2019-09-10 08:56:35,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4601 transitions. [2019-09-10 08:56:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 08:56:35,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:35,609 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] [2019-09-10 08:56:35,610 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:35,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1344265648, now seen corresponding path program 1 times [2019-09-10 08:56:35,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:35,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:35,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:35,828 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 08:56:35,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:35,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:35,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:35,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:35,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:35,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:35,831 INFO L87 Difference]: Start difference. First operand 2975 states and 4601 transitions. Second operand 3 states. [2019-09-10 08:56:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:35,915 INFO L93 Difference]: Finished difference Result 5897 states and 9107 transitions. [2019-09-10 08:56:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:35,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-10 08:56:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:35,946 INFO L225 Difference]: With dead ends: 5897 [2019-09-10 08:56:35,946 INFO L226 Difference]: Without dead ends: 5897 [2019-09-10 08:56:35,947 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 08:56:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2019-09-10 08:56:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 2993. [2019-09-10 08:56:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-09-10 08:56:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4622 transitions. [2019-09-10 08:56:36,075 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4622 transitions. Word has length 323 [2019-09-10 08:56:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:36,076 INFO L475 AbstractCegarLoop]: Abstraction has 2993 states and 4622 transitions. [2019-09-10 08:56:36,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4622 transitions. [2019-09-10 08:56:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:56:36,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:36,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:56:36,087 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:36,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1125276426, now seen corresponding path program 1 times [2019-09-10 08:56:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:36,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:36,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:36,501 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 08:56:36,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:36,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:36,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:36,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:36,505 INFO L87 Difference]: Start difference. First operand 2993 states and 4622 transitions. Second operand 3 states. [2019-09-10 08:56:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:36,679 INFO L93 Difference]: Finished difference Result 5772 states and 8845 transitions. [2019-09-10 08:56:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:36,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:56:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:36,719 INFO L225 Difference]: With dead ends: 5772 [2019-09-10 08:56:36,720 INFO L226 Difference]: Without dead ends: 5772 [2019-09-10 08:56:36,721 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 08:56:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2019-09-10 08:56:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 5770. [2019-09-10 08:56:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5770 states. [2019-09-10 08:56:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 8844 transitions. [2019-09-10 08:56:36,889 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 8844 transitions. Word has length 324 [2019-09-10 08:56:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:36,890 INFO L475 AbstractCegarLoop]: Abstraction has 5770 states and 8844 transitions. [2019-09-10 08:56:36,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 8844 transitions. [2019-09-10 08:56:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:56:36,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:36,908 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] [2019-09-10 08:56:36,909 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash -422622637, now seen corresponding path program 1 times [2019-09-10 08:56:36,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:36,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:36,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:37,269 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 08:56:37,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:37,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:37,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:37,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:37,271 INFO L87 Difference]: Start difference. First operand 5770 states and 8844 transitions. Second operand 4 states. [2019-09-10 08:56:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:37,423 INFO L93 Difference]: Finished difference Result 10545 states and 16069 transitions. [2019-09-10 08:56:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:37,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:56:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:37,482 INFO L225 Difference]: With dead ends: 10545 [2019-09-10 08:56:37,484 INFO L226 Difference]: Without dead ends: 10545 [2019-09-10 08:56:37,485 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 08:56:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10545 states. [2019-09-10 08:56:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10545 to 6005. [2019-09-10 08:56:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6005 states. [2019-09-10 08:56:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 9232 transitions. [2019-09-10 08:56:37,861 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 9232 transitions. Word has length 324 [2019-09-10 08:56:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:37,862 INFO L475 AbstractCegarLoop]: Abstraction has 6005 states and 9232 transitions. [2019-09-10 08:56:37,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 9232 transitions. [2019-09-10 08:56:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 08:56:37,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:37,884 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] [2019-09-10 08:56:37,885 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -835402189, now seen corresponding path program 1 times [2019-09-10 08:56:37,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:37,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:37,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:37,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:38,121 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 08:56:38,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:38,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:38,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:38,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:38,125 INFO L87 Difference]: Start difference. First operand 6005 states and 9232 transitions. Second operand 3 states. [2019-09-10 08:56:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:38,248 INFO L93 Difference]: Finished difference Result 7655 states and 11845 transitions. [2019-09-10 08:56:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:38,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-10 08:56:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:38,268 INFO L225 Difference]: With dead ends: 7655 [2019-09-10 08:56:38,269 INFO L226 Difference]: Without dead ends: 7655 [2019-09-10 08:56:38,269 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 08:56:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7655 states. [2019-09-10 08:56:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7655 to 6957. [2019-09-10 08:56:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-09-10 08:56:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 10796 transitions. [2019-09-10 08:56:38,438 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 10796 transitions. Word has length 325 [2019-09-10 08:56:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:38,438 INFO L475 AbstractCegarLoop]: Abstraction has 6957 states and 10796 transitions. [2019-09-10 08:56:38,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 10796 transitions. [2019-09-10 08:56:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:56:38,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:38,458 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] [2019-09-10 08:56:38,458 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash -803015533, now seen corresponding path program 1 times [2019-09-10 08:56:38,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:38,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:38,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:38,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:38,681 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 08:56:38,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:38,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:38,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:38,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:38,683 INFO L87 Difference]: Start difference. First operand 6957 states and 10796 transitions. Second operand 3 states. [2019-09-10 08:56:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:38,757 INFO L93 Difference]: Finished difference Result 13147 states and 20236 transitions. [2019-09-10 08:56:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:38,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:56:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:38,787 INFO L225 Difference]: With dead ends: 13147 [2019-09-10 08:56:38,787 INFO L226 Difference]: Without dead ends: 13147 [2019-09-10 08:56:38,788 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 08:56:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13147 states. [2019-09-10 08:56:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13147 to 7061. [2019-09-10 08:56:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7061 states. [2019-09-10 08:56:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7061 states to 7061 states and 10939 transitions. [2019-09-10 08:56:39,043 INFO L78 Accepts]: Start accepts. Automaton has 7061 states and 10939 transitions. Word has length 326 [2019-09-10 08:56:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:39,044 INFO L475 AbstractCegarLoop]: Abstraction has 7061 states and 10939 transitions. [2019-09-10 08:56:39,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7061 states and 10939 transitions. [2019-09-10 08:56:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:56:39,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:39,065 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] [2019-09-10 08:56:39,065 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1034080261, now seen corresponding path program 1 times [2019-09-10 08:56:39,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:39,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:39,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:39,235 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 08:56:39,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:39,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:39,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:39,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:39,238 INFO L87 Difference]: Start difference. First operand 7061 states and 10939 transitions. Second operand 3 states. [2019-09-10 08:56:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:39,335 INFO L93 Difference]: Finished difference Result 13272 states and 20382 transitions. [2019-09-10 08:56:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:39,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 08:56:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:39,367 INFO L225 Difference]: With dead ends: 13272 [2019-09-10 08:56:39,367 INFO L226 Difference]: Without dead ends: 13272 [2019-09-10 08:56:39,368 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 08:56:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13272 states. [2019-09-10 08:56:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13272 to 7186. [2019-09-10 08:56:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7186 states. [2019-09-10 08:56:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 11085 transitions. [2019-09-10 08:56:39,616 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 11085 transitions. Word has length 327 [2019-09-10 08:56:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:39,616 INFO L475 AbstractCegarLoop]: Abstraction has 7186 states and 11085 transitions. [2019-09-10 08:56:39,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 11085 transitions. [2019-09-10 08:56:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:56:39,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:39,641 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] [2019-09-10 08:56:39,641 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash -896780408, now seen corresponding path program 1 times [2019-09-10 08:56:39,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:39,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:39,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:39,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:39,961 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 08:56:39,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:39,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:39,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:39,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:39,966 INFO L87 Difference]: Start difference. First operand 7186 states and 11085 transitions. Second operand 3 states. [2019-09-10 08:56:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:40,084 INFO L93 Difference]: Finished difference Result 9996 states and 15526 transitions. [2019-09-10 08:56:40,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:40,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:56:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:40,115 INFO L225 Difference]: With dead ends: 9996 [2019-09-10 08:56:40,116 INFO L226 Difference]: Without dead ends: 9996 [2019-09-10 08:56:40,116 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 08:56:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2019-09-10 08:56:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 8938. [2019-09-10 08:56:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-09-10 08:56:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 13957 transitions. [2019-09-10 08:56:40,314 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 13957 transitions. Word has length 328 [2019-09-10 08:56:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:40,315 INFO L475 AbstractCegarLoop]: Abstraction has 8938 states and 13957 transitions. [2019-09-10 08:56:40,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 13957 transitions. [2019-09-10 08:56:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:56:40,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:40,332 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] [2019-09-10 08:56:40,332 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2095929178, now seen corresponding path program 1 times [2019-09-10 08:56:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:40,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:40,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:40,815 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 08:56:40,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:40,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:40,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:40,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:40,817 INFO L87 Difference]: Start difference. First operand 8938 states and 13957 transitions. Second operand 4 states. [2019-09-10 08:56:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:40,890 INFO L93 Difference]: Finished difference Result 8672 states and 13545 transitions. [2019-09-10 08:56:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:40,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:56:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:40,909 INFO L225 Difference]: With dead ends: 8672 [2019-09-10 08:56:40,910 INFO L226 Difference]: Without dead ends: 7875 [2019-09-10 08:56:40,910 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 08:56:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2019-09-10 08:56:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 7855. [2019-09-10 08:56:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7855 states. [2019-09-10 08:56:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7855 states to 7855 states and 12278 transitions. [2019-09-10 08:56:41,061 INFO L78 Accepts]: Start accepts. Automaton has 7855 states and 12278 transitions. Word has length 328 [2019-09-10 08:56:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:41,061 INFO L475 AbstractCegarLoop]: Abstraction has 7855 states and 12278 transitions. [2019-09-10 08:56:41,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7855 states and 12278 transitions. [2019-09-10 08:56:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:56:41,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:41,077 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] [2019-09-10 08:56:41,078 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1451184865, now seen corresponding path program 1 times [2019-09-10 08:56:41,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:41,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:41,484 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 08:56:41,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:41,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:56:41,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:41,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:56:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:56:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:56:41,486 INFO L87 Difference]: Start difference. First operand 7855 states and 12278 transitions. Second operand 5 states. [2019-09-10 08:56:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:42,363 INFO L93 Difference]: Finished difference Result 13392 states and 20948 transitions. [2019-09-10 08:56:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:56:42,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2019-09-10 08:56:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:42,394 INFO L225 Difference]: With dead ends: 13392 [2019-09-10 08:56:42,394 INFO L226 Difference]: Without dead ends: 13392 [2019-09-10 08:56:42,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:56:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-09-10 08:56:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 13390. [2019-09-10 08:56:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13390 states. [2019-09-10 08:56:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13390 states to 13390 states and 20947 transitions. [2019-09-10 08:56:42,625 INFO L78 Accepts]: Start accepts. Automaton has 13390 states and 20947 transitions. Word has length 328 [2019-09-10 08:56:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:42,626 INFO L475 AbstractCegarLoop]: Abstraction has 13390 states and 20947 transitions. [2019-09-10 08:56:42,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:56:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 13390 states and 20947 transitions. [2019-09-10 08:56:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:56:42,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:42,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:42,660 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash 165110372, now seen corresponding path program 1 times [2019-09-10 08:56:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:42,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:42,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:42,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:43,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:43,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:56:43,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:43,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:56:43,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:56:43,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:56:43,197 INFO L87 Difference]: Start difference. First operand 13390 states and 20947 transitions. Second operand 8 states. [2019-09-10 08:56:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:45,749 INFO L93 Difference]: Finished difference Result 62647 states and 99607 transitions. [2019-09-10 08:56:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:56:45,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2019-09-10 08:56:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:45,913 INFO L225 Difference]: With dead ends: 62647 [2019-09-10 08:56:45,914 INFO L226 Difference]: Without dead ends: 62647 [2019-09-10 08:56:45,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:56:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62647 states. [2019-09-10 08:56:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62647 to 31409. [2019-09-10 08:56:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31409 states. [2019-09-10 08:56:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31409 states to 31409 states and 49097 transitions. [2019-09-10 08:56:46,611 INFO L78 Accepts]: Start accepts. Automaton has 31409 states and 49097 transitions. Word has length 328 [2019-09-10 08:56:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:46,612 INFO L475 AbstractCegarLoop]: Abstraction has 31409 states and 49097 transitions. [2019-09-10 08:56:46,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:56:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31409 states and 49097 transitions. [2019-09-10 08:56:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:56:46,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:46,653 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] [2019-09-10 08:56:46,653 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:46,653 INFO L82 PathProgramCache]: Analyzing trace with hash 979470509, now seen corresponding path program 1 times [2019-09-10 08:56:46,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:46,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:46,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:46,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:48,009 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 08:56:48,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:56:48,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:48,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:56:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:56:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:56:48,013 INFO L87 Difference]: Start difference. First operand 31409 states and 49097 transitions. Second operand 9 states. [2019-09-10 08:56:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:49,325 INFO L93 Difference]: Finished difference Result 29782 states and 46547 transitions. [2019-09-10 08:56:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:56:49,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 328 [2019-09-10 08:56:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:49,372 INFO L225 Difference]: With dead ends: 29782 [2019-09-10 08:56:49,372 INFO L226 Difference]: Without dead ends: 29782 [2019-09-10 08:56:49,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:56:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29782 states. [2019-09-10 08:56:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29782 to 16624. [2019-09-10 08:56:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-09-10 08:56:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 25588 transitions. [2019-09-10 08:56:49,750 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 25588 transitions. Word has length 328 [2019-09-10 08:56:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:49,751 INFO L475 AbstractCegarLoop]: Abstraction has 16624 states and 25588 transitions. [2019-09-10 08:56:49,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:56:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 25588 transitions. [2019-09-10 08:56:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:56:49,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:49,763 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] [2019-09-10 08:56:49,764 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1113342249, now seen corresponding path program 1 times [2019-09-10 08:56:49,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:49,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:49,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:50,459 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 08:56:50,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:50,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:50,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:50,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:50,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:50,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:50,462 INFO L87 Difference]: Start difference. First operand 16624 states and 25588 transitions. Second operand 4 states. [2019-09-10 08:56:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:50,677 INFO L93 Difference]: Finished difference Result 32343 states and 49560 transitions. [2019-09-10 08:56:50,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:50,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:56:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:50,738 INFO L225 Difference]: With dead ends: 32343 [2019-09-10 08:56:50,738 INFO L226 Difference]: Without dead ends: 32343 [2019-09-10 08:56:50,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:56:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32343 states. [2019-09-10 08:56:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32343 to 32341. [2019-09-10 08:56:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32341 states. [2019-09-10 08:56:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32341 states to 32341 states and 49559 transitions. [2019-09-10 08:56:51,620 INFO L78 Accepts]: Start accepts. Automaton has 32341 states and 49559 transitions. Word has length 328 [2019-09-10 08:56:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:51,621 INFO L475 AbstractCegarLoop]: Abstraction has 32341 states and 49559 transitions. [2019-09-10 08:56:51,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32341 states and 49559 transitions. [2019-09-10 08:56:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:56:51,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:51,642 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] [2019-09-10 08:56:51,642 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1102800965, now seen corresponding path program 1 times [2019-09-10 08:56:51,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:51,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:51,921 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 08:56:51,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:51,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:51,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:51,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:51,926 INFO L87 Difference]: Start difference. First operand 32341 states and 49559 transitions. Second operand 3 states. [2019-09-10 08:56:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:52,188 INFO L93 Difference]: Finished difference Result 62805 states and 95777 transitions. [2019-09-10 08:56:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:52,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:56:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:52,314 INFO L225 Difference]: With dead ends: 62805 [2019-09-10 08:56:52,314 INFO L226 Difference]: Without dead ends: 62805 [2019-09-10 08:56:52,315 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 08:56:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62805 states. [2019-09-10 08:56:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62805 to 62803. [2019-09-10 08:56:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62803 states. [2019-09-10 08:56:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62803 states to 62803 states and 95776 transitions. [2019-09-10 08:56:53,596 INFO L78 Accepts]: Start accepts. Automaton has 62803 states and 95776 transitions. Word has length 330 [2019-09-10 08:56:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:53,597 INFO L475 AbstractCegarLoop]: Abstraction has 62803 states and 95776 transitions. [2019-09-10 08:56:53,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62803 states and 95776 transitions. [2019-09-10 08:56:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:56:53,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:53,637 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] [2019-09-10 08:56:53,637 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1097536706, now seen corresponding path program 1 times [2019-09-10 08:56:53,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:53,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:53,820 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 08:56:53,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:53,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:53,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:53,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:53,824 INFO L87 Difference]: Start difference. First operand 62803 states and 95776 transitions. Second operand 3 states. [2019-09-10 08:56:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:54,164 INFO L93 Difference]: Finished difference Result 100357 states and 153969 transitions. [2019-09-10 08:56:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:54,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:56:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:54,288 INFO L225 Difference]: With dead ends: 100357 [2019-09-10 08:56:54,289 INFO L226 Difference]: Without dead ends: 100357 [2019-09-10 08:56:54,289 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 08:56:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100357 states. [2019-09-10 08:56:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100357 to 91939. [2019-09-10 08:56:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91939 states. [2019-09-10 08:56:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91939 states to 91939 states and 141396 transitions. [2019-09-10 08:56:57,162 INFO L78 Accepts]: Start accepts. Automaton has 91939 states and 141396 transitions. Word has length 332 [2019-09-10 08:56:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:57,162 INFO L475 AbstractCegarLoop]: Abstraction has 91939 states and 141396 transitions. [2019-09-10 08:56:57,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 91939 states and 141396 transitions. [2019-09-10 08:56:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:56:57,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:57,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:57,202 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1777906688, now seen corresponding path program 1 times [2019-09-10 08:56:57,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:57,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:57,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:57,464 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 08:56:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:57,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:57,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:57,467 INFO L87 Difference]: Start difference. First operand 91939 states and 141396 transitions. Second operand 3 states. [2019-09-10 08:56:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:57,991 INFO L93 Difference]: Finished difference Result 180288 states and 275700 transitions. [2019-09-10 08:56:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:57,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:56:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:58,209 INFO L225 Difference]: With dead ends: 180288 [2019-09-10 08:56:58,209 INFO L226 Difference]: Without dead ends: 180288 [2019-09-10 08:56:58,209 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 08:56:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180288 states. [2019-09-10 08:57:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180288 to 180286. [2019-09-10 08:57:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180286 states. [2019-09-10 08:57:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180286 states to 180286 states and 275699 transitions. [2019-09-10 08:57:02,249 INFO L78 Accepts]: Start accepts. Automaton has 180286 states and 275699 transitions. Word has length 332 [2019-09-10 08:57:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:02,250 INFO L475 AbstractCegarLoop]: Abstraction has 180286 states and 275699 transitions. [2019-09-10 08:57:02,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 180286 states and 275699 transitions. [2019-09-10 08:57:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:57:02,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:02,324 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] [2019-09-10 08:57:02,325 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:02,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:02,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2098323555, now seen corresponding path program 1 times [2019-09-10 08:57:02,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:02,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:02,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:02,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:03,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 08:57:03,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:03,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:03,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:03,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:03,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:03,342 INFO L87 Difference]: Start difference. First operand 180286 states and 275699 transitions. Second operand 4 states. [2019-09-10 08:57:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:04,273 INFO L93 Difference]: Finished difference Result 310852 states and 474045 transitions. [2019-09-10 08:57:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:04,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 08:57:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:04,819 INFO L225 Difference]: With dead ends: 310852 [2019-09-10 08:57:04,820 INFO L226 Difference]: Without dead ends: 310852 [2019-09-10 08:57:04,821 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 08:57:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310852 states. [2019-09-10 08:57:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310852 to 176156. [2019-09-10 08:57:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176156 states. [2019-09-10 08:57:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176156 states to 176156 states and 269271 transitions. [2019-09-10 08:57:11,634 INFO L78 Accepts]: Start accepts. Automaton has 176156 states and 269271 transitions. Word has length 332 [2019-09-10 08:57:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:11,634 INFO L475 AbstractCegarLoop]: Abstraction has 176156 states and 269271 transitions. [2019-09-10 08:57:11,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 176156 states and 269271 transitions. [2019-09-10 08:57:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 08:57:11,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:11,687 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] [2019-09-10 08:57:11,687 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash 46844777, now seen corresponding path program 1 times [2019-09-10 08:57:11,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:11,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:11,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:11,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:11,844 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 08:57:11,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:11,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:11,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:11,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:11,847 INFO L87 Difference]: Start difference. First operand 176156 states and 269271 transitions. Second operand 3 states. [2019-09-10 08:57:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:13,683 INFO L93 Difference]: Finished difference Result 311175 states and 474788 transitions. [2019-09-10 08:57:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:13,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 08:57:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:14,046 INFO L225 Difference]: With dead ends: 311175 [2019-09-10 08:57:14,046 INFO L226 Difference]: Without dead ends: 311175 [2019-09-10 08:57:14,046 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 08:57:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311175 states. [2019-09-10 08:57:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311175 to 176637. [2019-09-10 08:57:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176637 states. [2019-09-10 08:57:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176637 states to 176637 states and 269869 transitions. [2019-09-10 08:57:20,340 INFO L78 Accepts]: Start accepts. Automaton has 176637 states and 269869 transitions. Word has length 335 [2019-09-10 08:57:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:20,340 INFO L475 AbstractCegarLoop]: Abstraction has 176637 states and 269869 transitions. [2019-09-10 08:57:20,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 176637 states and 269869 transitions. [2019-09-10 08:57:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:57:20,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:20,394 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] [2019-09-10 08:57:20,394 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:20,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1969439735, now seen corresponding path program 1 times [2019-09-10 08:57:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:20,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:20,976 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 08:57:20,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:20,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:20,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:20,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:20,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:20,979 INFO L87 Difference]: Start difference. First operand 176637 states and 269869 transitions. Second operand 4 states. [2019-09-10 08:57:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:22,080 INFO L93 Difference]: Finished difference Result 334180 states and 507816 transitions. [2019-09-10 08:57:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:22,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-10 08:57:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:22,636 INFO L225 Difference]: With dead ends: 334180 [2019-09-10 08:57:22,637 INFO L226 Difference]: Without dead ends: 334180 [2019-09-10 08:57:22,637 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 08:57:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334180 states. [2019-09-10 08:57:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334180 to 334178. [2019-09-10 08:57:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334178 states. [2019-09-10 08:57:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334178 states to 334178 states and 507815 transitions. [2019-09-10 08:57:33,732 INFO L78 Accepts]: Start accepts. Automaton has 334178 states and 507815 transitions. Word has length 336 [2019-09-10 08:57:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:33,732 INFO L475 AbstractCegarLoop]: Abstraction has 334178 states and 507815 transitions. [2019-09-10 08:57:33,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 334178 states and 507815 transitions. [2019-09-10 08:57:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 08:57:33,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:33,844 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] [2019-09-10 08:57:33,844 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2134112359, now seen corresponding path program 1 times [2019-09-10 08:57:33,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:33,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:33,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:34,086 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 08:57:34,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:34,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:34,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:34,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:34,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:34,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:34,088 INFO L87 Difference]: Start difference. First operand 334178 states and 507815 transitions. Second operand 3 states. [2019-09-10 08:57:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:35,596 INFO L93 Difference]: Finished difference Result 651378 states and 985612 transitions. [2019-09-10 08:57:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:35,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-10 08:57:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:38,292 INFO L225 Difference]: With dead ends: 651378 [2019-09-10 08:57:38,293 INFO L226 Difference]: Without dead ends: 651378 [2019-09-10 08:57:38,293 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 08:57:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651378 states. [2019-09-10 08:57:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651378 to 651072. [2019-09-10 08:57:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651072 states. [2019-09-10 08:57:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651072 states to 651072 states and 985231 transitions. [2019-09-10 08:57:52,482 INFO L78 Accepts]: Start accepts. Automaton has 651072 states and 985231 transitions. Word has length 337 [2019-09-10 08:57:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:52,482 INFO L475 AbstractCegarLoop]: Abstraction has 651072 states and 985231 transitions. [2019-09-10 08:57:52,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 651072 states and 985231 transitions. [2019-09-10 08:58:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 08:58:01,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:01,571 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] [2019-09-10 08:58:01,572 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:01,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1690616902, now seen corresponding path program 1 times [2019-09-10 08:58:01,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:01,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:01,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:01,918 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 08:58:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:58:01,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:01,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:58:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:58:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:58:01,920 INFO L87 Difference]: Start difference. First operand 651072 states and 985231 transitions. Second operand 4 states. [2019-09-10 08:58:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:03,239 INFO L93 Difference]: Finished difference Result 592418 states and 895029 transitions. [2019-09-10 08:58:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:58:03,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-09-10 08:58:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:04,233 INFO L225 Difference]: With dead ends: 592418 [2019-09-10 08:58:04,234 INFO L226 Difference]: Without dead ends: 576237 [2019-09-10 08:58:04,235 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 08:58:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576237 states. [2019-09-10 08:58:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576237 to 575019. [2019-09-10 08:58:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575019 states. [2019-09-10 08:58:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575019 states to 575019 states and 868880 transitions. [2019-09-10 08:58:29,001 INFO L78 Accepts]: Start accepts. Automaton has 575019 states and 868880 transitions. Word has length 338 [2019-09-10 08:58:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:29,002 INFO L475 AbstractCegarLoop]: Abstraction has 575019 states and 868880 transitions. [2019-09-10 08:58:29,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 575019 states and 868880 transitions. [2019-09-10 08:58:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 08:58:29,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:29,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:29,136 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1208576600, now seen corresponding path program 1 times [2019-09-10 08:58:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:29,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:29,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:29,294 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 08:58:29,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:29,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:29,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:29,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:29,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:29,296 INFO L87 Difference]: Start difference. First operand 575019 states and 868880 transitions. Second operand 3 states. [2019-09-10 08:58:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:32,998 INFO L93 Difference]: Finished difference Result 998541 states and 1521711 transitions. [2019-09-10 08:58:32,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:58:32,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-09-10 08:58:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:34,466 INFO L225 Difference]: With dead ends: 998541 [2019-09-10 08:58:34,466 INFO L226 Difference]: Without dead ends: 998541 [2019-09-10 08:58:34,467 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 08:58:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998541 states. [2019-09-10 08:59:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998541 to 902291. [2019-09-10 08:59:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902291 states. [2019-09-10 08:59:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902291 states to 902291 states and 1386342 transitions. [2019-09-10 08:59:03,302 INFO L78 Accepts]: Start accepts. Automaton has 902291 states and 1386342 transitions. Word has length 339 [2019-09-10 08:59:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:03,303 INFO L475 AbstractCegarLoop]: Abstraction has 902291 states and 1386342 transitions. [2019-09-10 08:59:03,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:59:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 902291 states and 1386342 transitions. [2019-09-10 08:59:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 08:59:05,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:05,478 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] [2019-09-10 08:59:05,479 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1555248995, now seen corresponding path program 1 times [2019-09-10 08:59:05,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:05,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:59:05,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:05,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:05,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:05,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:05,713 INFO L87 Difference]: Start difference. First operand 902291 states and 1386342 transitions. Second operand 3 states. [2019-09-10 08:59:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:24,186 INFO L93 Difference]: Finished difference Result 1769097 states and 2701998 transitions. [2019-09-10 08:59:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:24,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 08:59:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:27,885 INFO L225 Difference]: With dead ends: 1769097 [2019-09-10 08:59:27,885 INFO L226 Difference]: Without dead ends: 1769097 [2019-09-10 08:59:27,886 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 08:59:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769097 states. [2019-09-10 09:00:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769097 to 1769095. [2019-09-10 09:00:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769095 states.