java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:28:40,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:28:40,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:28:40,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:28:40,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:28:40,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:28:40,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:28:40,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:28:40,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:28:40,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:28:40,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:28:40,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:28:40,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:28:40,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:28:40,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:28:40,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:28:40,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:28:40,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:28:40,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:28:40,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:28:40,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:28:40,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:28:40,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:28:40,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:28:40,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:28:40,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:28:40,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:28:40,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:28:40,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:28:40,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:28:40,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:28:40,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:28:40,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:28:40,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:28:40,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:28:40,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:28:40,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:28:40,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:28:40,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:28:40,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:28:40,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:28:40,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:28:40,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:28:40,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:28:40,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:28:40,385 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:28:40,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:28:40,386 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:28:40,386 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:28:40,387 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:28:40,387 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:28:40,387 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:28:40,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:28:40,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:28:40,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:28:40,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:28:40,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:28:40,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:28:40,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:28:40,389 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:28:40,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:28:40,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:28:40,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:28:40,390 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:28:40,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:28:40,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:28:40,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:28:40,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:28:40,391 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:28:40,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:28:40,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:28:40,391 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:28:40,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:28:40,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:28:40,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:28:40,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:28:40,440 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:28:40,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:28:40,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39776698b/6d4e2555ef9b44cb9f8d9356ede5d2d0/FLAGa78d63f72 [2019-09-10 06:28:41,184 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:28:41,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:28:41,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39776698b/6d4e2555ef9b44cb9f8d9356ede5d2d0/FLAGa78d63f72 [2019-09-10 06:28:41,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39776698b/6d4e2555ef9b44cb9f8d9356ede5d2d0 [2019-09-10 06:28:41,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:28:41,337 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:28:41,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:28:41,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:28:41,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:28:41,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:28:41" (1/1) ... [2019-09-10 06:28:41,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0055c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:41, skipping insertion in model container [2019-09-10 06:28:41,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:28:41" (1/1) ... [2019-09-10 06:28:41,353 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:28:41,501 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:28:43,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:28:43,053 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:28:44,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:28:44,377 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:28:44,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44 WrapperNode [2019-09-10 06:28:44,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:28:44,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:28:44,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:28:44,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:28:44,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... [2019-09-10 06:28:44,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:28:44,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:28:44,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:28:44,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:28:44,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:28:44,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:28:44,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:28:44,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:28:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:28:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:28:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:28:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:28:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:28:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:28:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:28:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:28:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:28:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:28:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:28:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:28:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:28:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:28:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:28:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:28:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:28:48,113 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:28:48,113 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:28:48,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:28:48 BoogieIcfgContainer [2019-09-10 06:28:48,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:28:48,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:28:48,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:28:48,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:28:48,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:28:41" (1/3) ... [2019-09-10 06:28:48,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69da2c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:28:48, skipping insertion in model container [2019-09-10 06:28:48,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:44" (2/3) ... [2019-09-10 06:28:48,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69da2c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:28:48, skipping insertion in model container [2019-09-10 06:28:48,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:28:48" (3/3) ... [2019-09-10 06:28:48,123 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:28:48,133 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:28:48,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:28:48,160 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:28:48,187 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:28:48,188 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:28:48,188 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:28:48,188 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:28:48,188 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:28:48,188 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:28:48,188 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:28:48,189 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:28:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states. [2019-09-10 06:28:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:28:48,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:48,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:48,256 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1047538598, now seen corresponding path program 1 times [2019-09-10 06:28:48,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:48,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:48,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:48,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:48,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:49,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:49,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:49,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:49,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:49,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:49,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:49,278 INFO L87 Difference]: Start difference. First operand 934 states. Second operand 3 states. [2019-09-10 06:28:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:49,607 INFO L93 Difference]: Finished difference Result 1343 states and 2383 transitions. [2019-09-10 06:28:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:49,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:28:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:49,637 INFO L225 Difference]: With dead ends: 1343 [2019-09-10 06:28:49,637 INFO L226 Difference]: Without dead ends: 1335 [2019-09-10 06:28:49,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-10 06:28:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-09-10 06:28:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-10 06:28:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2029 transitions. [2019-09-10 06:28:49,756 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2029 transitions. Word has length 308 [2019-09-10 06:28:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:49,761 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2029 transitions. [2019-09-10 06:28:49,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2029 transitions. [2019-09-10 06:28:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:28:49,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:49,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:49,776 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1368896459, now seen corresponding path program 1 times [2019-09-10 06:28:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:49,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:49,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:50,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:50,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:28:50,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:50,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:28:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:28:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:28:50,851 INFO L87 Difference]: Start difference. First operand 1333 states and 2029 transitions. Second operand 4 states. [2019-09-10 06:28:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:51,070 INFO L93 Difference]: Finished difference Result 2617 states and 3959 transitions. [2019-09-10 06:28:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:28:51,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:28:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:51,085 INFO L225 Difference]: With dead ends: 2617 [2019-09-10 06:28:51,085 INFO L226 Difference]: Without dead ends: 2617 [2019-09-10 06:28:51,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:28:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-09-10 06:28:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2521. [2019-09-10 06:28:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-10 06:28:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3840 transitions. [2019-09-10 06:28:51,159 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3840 transitions. Word has length 308 [2019-09-10 06:28:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:51,160 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 3840 transitions. [2019-09-10 06:28:51,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:28:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3840 transitions. [2019-09-10 06:28:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:28:51,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:51,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:51,175 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1611556797, now seen corresponding path program 1 times [2019-09-10 06:28:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:51,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:51,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:51,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:51,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:51,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:51,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:51,546 INFO L87 Difference]: Start difference. First operand 2521 states and 3840 transitions. Second operand 3 states. [2019-09-10 06:28:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:51,680 INFO L93 Difference]: Finished difference Result 4956 states and 7508 transitions. [2019-09-10 06:28:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:51,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:28:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:51,710 INFO L225 Difference]: With dead ends: 4956 [2019-09-10 06:28:51,710 INFO L226 Difference]: Without dead ends: 4956 [2019-09-10 06:28:51,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-10 06:28:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4860. [2019-09-10 06:28:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2019-09-10 06:28:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 7389 transitions. [2019-09-10 06:28:51,830 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 7389 transitions. Word has length 310 [2019-09-10 06:28:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:51,830 INFO L475 AbstractCegarLoop]: Abstraction has 4860 states and 7389 transitions. [2019-09-10 06:28:51,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 7389 transitions. [2019-09-10 06:28:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:28:51,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:51,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:51,844 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash 158227778, now seen corresponding path program 1 times [2019-09-10 06:28:51,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:51,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:51,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:52,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:52,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:52,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:52,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:52,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:52,074 INFO L87 Difference]: Start difference. First operand 4860 states and 7389 transitions. Second operand 3 states. [2019-09-10 06:28:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:52,212 INFO L93 Difference]: Finished difference Result 9687 states and 14718 transitions. [2019-09-10 06:28:52,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:52,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:28:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:52,270 INFO L225 Difference]: With dead ends: 9687 [2019-09-10 06:28:52,270 INFO L226 Difference]: Without dead ends: 9687 [2019-09-10 06:28:52,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2019-09-10 06:28:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 4879. [2019-09-10 06:28:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-09-10 06:28:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 7417 transitions. [2019-09-10 06:28:52,527 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 7417 transitions. Word has length 310 [2019-09-10 06:28:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:52,527 INFO L475 AbstractCegarLoop]: Abstraction has 4879 states and 7417 transitions. [2019-09-10 06:28:52,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 7417 transitions. [2019-09-10 06:28:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:28:52,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:52,548 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:52,548 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2041948487, now seen corresponding path program 1 times [2019-09-10 06:28:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:52,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:52,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:52,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:52,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:52,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:52,693 INFO L87 Difference]: Start difference. First operand 4879 states and 7417 transitions. Second operand 3 states. [2019-09-10 06:28:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:52,771 INFO L93 Difference]: Finished difference Result 9705 states and 14739 transitions. [2019-09-10 06:28:52,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:52,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:28:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:52,812 INFO L225 Difference]: With dead ends: 9705 [2019-09-10 06:28:52,813 INFO L226 Difference]: Without dead ends: 9705 [2019-09-10 06:28:52,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-09-10 06:28:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 4897. [2019-09-10 06:28:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-09-10 06:28:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 7438 transitions. [2019-09-10 06:28:52,984 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 7438 transitions. Word has length 311 [2019-09-10 06:28:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:52,984 INFO L475 AbstractCegarLoop]: Abstraction has 4897 states and 7438 transitions. [2019-09-10 06:28:52,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 7438 transitions. [2019-09-10 06:28:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:28:52,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:52,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:52,999 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:53,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1063211659, now seen corresponding path program 1 times [2019-09-10 06:28:53,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:53,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:53,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:53,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:53,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:53,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:53,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:28:53,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:53,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:28:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:28:53,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:28:53,506 INFO L87 Difference]: Start difference. First operand 4897 states and 7438 transitions. Second operand 4 states. [2019-09-10 06:28:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:53,592 INFO L93 Difference]: Finished difference Result 9632 states and 14588 transitions. [2019-09-10 06:28:53,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:28:53,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:28:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:53,613 INFO L225 Difference]: With dead ends: 9632 [2019-09-10 06:28:53,613 INFO L226 Difference]: Without dead ends: 9632 [2019-09-10 06:28:53,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:28:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2019-09-10 06:28:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 5104. [2019-09-10 06:28:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-09-10 06:28:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7791 transitions. [2019-09-10 06:28:53,751 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7791 transitions. Word has length 312 [2019-09-10 06:28:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:53,752 INFO L475 AbstractCegarLoop]: Abstraction has 5104 states and 7791 transitions. [2019-09-10 06:28:53,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:28:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7791 transitions. [2019-09-10 06:28:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:28:53,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:53,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:53,765 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash 76522648, now seen corresponding path program 1 times [2019-09-10 06:28:53,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:53,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:54,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:54,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:54,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:54,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:54,078 INFO L87 Difference]: Start difference. First operand 5104 states and 7791 transitions. Second operand 3 states. [2019-09-10 06:28:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:54,200 INFO L93 Difference]: Finished difference Result 9767 states and 14765 transitions. [2019-09-10 06:28:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:54,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:28:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:54,220 INFO L225 Difference]: With dead ends: 9767 [2019-09-10 06:28:54,220 INFO L226 Difference]: Without dead ends: 9767 [2019-09-10 06:28:54,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-09-10 06:28:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9671. [2019-09-10 06:28:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-09-10 06:28:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 14646 transitions. [2019-09-10 06:28:54,386 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 14646 transitions. Word has length 312 [2019-09-10 06:28:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:54,387 INFO L475 AbstractCegarLoop]: Abstraction has 9671 states and 14646 transitions. [2019-09-10 06:28:54,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 14646 transitions. [2019-09-10 06:28:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:28:54,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:54,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:54,406 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:54,407 INFO L82 PathProgramCache]: Analyzing trace with hash 344350536, now seen corresponding path program 1 times [2019-09-10 06:28:54,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:54,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:54,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:54,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:54,551 INFO L87 Difference]: Start difference. First operand 9671 states and 14646 transitions. Second operand 3 states. [2019-09-10 06:28:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:54,636 INFO L93 Difference]: Finished difference Result 18575 states and 27936 transitions. [2019-09-10 06:28:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:54,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:28:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:54,679 INFO L225 Difference]: With dead ends: 18575 [2019-09-10 06:28:54,679 INFO L226 Difference]: Without dead ends: 18575 [2019-09-10 06:28:54,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-09-10 06:28:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 9775. [2019-09-10 06:28:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9775 states. [2019-09-10 06:28:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14789 transitions. [2019-09-10 06:28:54,962 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14789 transitions. Word has length 314 [2019-09-10 06:28:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:54,963 INFO L475 AbstractCegarLoop]: Abstraction has 9775 states and 14789 transitions. [2019-09-10 06:28:54,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14789 transitions. [2019-09-10 06:28:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:28:54,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:54,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:54,986 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1359161051, now seen corresponding path program 1 times [2019-09-10 06:28:54,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:54,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:54,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:54,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:54,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:55,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:55,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:55,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:55,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:55,229 INFO L87 Difference]: Start difference. First operand 9775 states and 14789 transitions. Second operand 3 states. [2019-09-10 06:28:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:55,302 INFO L93 Difference]: Finished difference Result 18700 states and 28082 transitions. [2019-09-10 06:28:55,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:55,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 06:28:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:55,343 INFO L225 Difference]: With dead ends: 18700 [2019-09-10 06:28:55,344 INFO L226 Difference]: Without dead ends: 18700 [2019-09-10 06:28:55,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18700 states. [2019-09-10 06:28:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18700 to 9900. [2019-09-10 06:28:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9900 states. [2019-09-10 06:28:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 14935 transitions. [2019-09-10 06:28:55,572 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 14935 transitions. Word has length 315 [2019-09-10 06:28:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:55,573 INFO L475 AbstractCegarLoop]: Abstraction has 9900 states and 14935 transitions. [2019-09-10 06:28:55,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 14935 transitions. [2019-09-10 06:28:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:28:55,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:55,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:55,594 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1350075397, now seen corresponding path program 1 times [2019-09-10 06:28:55,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:55,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:55,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:28:55,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:55,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:28:55,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:28:55,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:28:55,951 INFO L87 Difference]: Start difference. First operand 9900 states and 14935 transitions. Second operand 4 states. [2019-09-10 06:28:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:56,012 INFO L93 Difference]: Finished difference Result 9525 states and 14413 transitions. [2019-09-10 06:28:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:28:56,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 06:28:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:56,030 INFO L225 Difference]: With dead ends: 9525 [2019-09-10 06:28:56,031 INFO L226 Difference]: Without dead ends: 8728 [2019-09-10 06:28:56,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:28:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-09-10 06:28:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 8708. [2019-09-10 06:28:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8708 states. [2019-09-10 06:28:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8708 states to 8708 states and 13146 transitions. [2019-09-10 06:28:56,240 INFO L78 Accepts]: Start accepts. Automaton has 8708 states and 13146 transitions. Word has length 316 [2019-09-10 06:28:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:56,241 INFO L475 AbstractCegarLoop]: Abstraction has 8708 states and 13146 transitions. [2019-09-10 06:28:56,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:28:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8708 states and 13146 transitions. [2019-09-10 06:28:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:28:56,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:56,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:56,271 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1210298449, now seen corresponding path program 1 times [2019-09-10 06:28:56,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:56,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:56,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:56,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:56,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:56,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:56,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:28:56,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:56,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:28:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:28:56,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:28:56,773 INFO L87 Difference]: Start difference. First operand 8708 states and 13146 transitions. Second operand 8 states. [2019-09-10 06:28:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:57,171 INFO L93 Difference]: Finished difference Result 14070 states and 21203 transitions. [2019-09-10 06:28:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:28:57,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 320 [2019-09-10 06:28:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:57,202 INFO L225 Difference]: With dead ends: 14070 [2019-09-10 06:28:57,202 INFO L226 Difference]: Without dead ends: 14070 [2019-09-10 06:28:57,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:28:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14070 states. [2019-09-10 06:28:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14070 to 14068. [2019-09-10 06:28:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14068 states. [2019-09-10 06:28:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14068 states to 14068 states and 21202 transitions. [2019-09-10 06:28:57,373 INFO L78 Accepts]: Start accepts. Automaton has 14068 states and 21202 transitions. Word has length 320 [2019-09-10 06:28:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:57,374 INFO L475 AbstractCegarLoop]: Abstraction has 14068 states and 21202 transitions. [2019-09-10 06:28:57,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:28:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14068 states and 21202 transitions. [2019-09-10 06:28:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:28:57,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:57,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:57,399 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:57,400 INFO L82 PathProgramCache]: Analyzing trace with hash -26379179, now seen corresponding path program 1 times [2019-09-10 06:28:57,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:57,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:57,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:57,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:57,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:57,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:57,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:57,731 INFO L87 Difference]: Start difference. First operand 14068 states and 21202 transitions. Second operand 3 states. [2019-09-10 06:28:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:58,064 INFO L93 Difference]: Finished difference Result 24810 states and 37371 transitions. [2019-09-10 06:28:58,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:58,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 06:28:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:58,105 INFO L225 Difference]: With dead ends: 24810 [2019-09-10 06:28:58,105 INFO L226 Difference]: Without dead ends: 24810 [2019-09-10 06:28:58,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24810 states. [2019-09-10 06:28:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24810 to 24784. [2019-09-10 06:28:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24784 states. [2019-09-10 06:28:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24784 states to 24784 states and 37346 transitions. [2019-09-10 06:28:58,472 INFO L78 Accepts]: Start accepts. Automaton has 24784 states and 37346 transitions. Word has length 320 [2019-09-10 06:28:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:58,472 INFO L475 AbstractCegarLoop]: Abstraction has 24784 states and 37346 transitions. [2019-09-10 06:28:58,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 24784 states and 37346 transitions. [2019-09-10 06:28:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:28:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:58,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:58,505 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash 599474300, now seen corresponding path program 1 times [2019-09-10 06:28:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:58,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:58,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:58,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:59,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:28:59,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:59,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:28:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:28:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:28:59,729 INFO L87 Difference]: Start difference. First operand 24784 states and 37346 transitions. Second operand 17 states. [2019-09-10 06:29:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:04,076 INFO L93 Difference]: Finished difference Result 40824 states and 61984 transitions. [2019-09-10 06:29:04,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:29:04,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 320 [2019-09-10 06:29:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:04,127 INFO L225 Difference]: With dead ends: 40824 [2019-09-10 06:29:04,127 INFO L226 Difference]: Without dead ends: 40824 [2019-09-10 06:29:04,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:29:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40824 states. [2019-09-10 06:29:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40824 to 28368. [2019-09-10 06:29:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28368 states. [2019-09-10 06:29:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28368 states to 28368 states and 42434 transitions. [2019-09-10 06:29:04,597 INFO L78 Accepts]: Start accepts. Automaton has 28368 states and 42434 transitions. Word has length 320 [2019-09-10 06:29:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:04,598 INFO L475 AbstractCegarLoop]: Abstraction has 28368 states and 42434 transitions. [2019-09-10 06:29:04,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:29:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28368 states and 42434 transitions. [2019-09-10 06:29:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:29:04,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:04,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:04,631 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1649933196, now seen corresponding path program 1 times [2019-09-10 06:29:04,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:04,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:04,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:04,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:06,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:06,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:06,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:06,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:06,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:06,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:06,032 INFO L87 Difference]: Start difference. First operand 28368 states and 42434 transitions. Second operand 4 states. [2019-09-10 06:29:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:06,260 INFO L93 Difference]: Finished difference Result 55342 states and 82145 transitions. [2019-09-10 06:29:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:06,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 06:29:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:06,325 INFO L225 Difference]: With dead ends: 55342 [2019-09-10 06:29:06,325 INFO L226 Difference]: Without dead ends: 55342 [2019-09-10 06:29:06,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55342 states. [2019-09-10 06:29:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55342 to 55240. [2019-09-10 06:29:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55240 states. [2019-09-10 06:29:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55240 states to 55240 states and 82018 transitions. [2019-09-10 06:29:06,991 INFO L78 Accepts]: Start accepts. Automaton has 55240 states and 82018 transitions. Word has length 320 [2019-09-10 06:29:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:06,992 INFO L475 AbstractCegarLoop]: Abstraction has 55240 states and 82018 transitions. [2019-09-10 06:29:06,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 55240 states and 82018 transitions. [2019-09-10 06:29:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:29:07,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:07,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:07,040 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash 139592251, now seen corresponding path program 1 times [2019-09-10 06:29:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:07,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:07,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:07,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:07,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:07,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:07,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:07,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:07,500 INFO L87 Difference]: Start difference. First operand 55240 states and 82018 transitions. Second operand 3 states. [2019-09-10 06:29:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:07,944 INFO L93 Difference]: Finished difference Result 107771 states and 158715 transitions. [2019-09-10 06:29:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:07,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 06:29:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:08,080 INFO L225 Difference]: With dead ends: 107771 [2019-09-10 06:29:08,080 INFO L226 Difference]: Without dead ends: 107771 [2019-09-10 06:29:08,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107771 states. [2019-09-10 06:29:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107771 to 107673. [2019-09-10 06:29:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107673 states. [2019-09-10 06:29:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107673 states to 107673 states and 158596 transitions. [2019-09-10 06:29:10,932 INFO L78 Accepts]: Start accepts. Automaton has 107673 states and 158596 transitions. Word has length 322 [2019-09-10 06:29:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:10,933 INFO L475 AbstractCegarLoop]: Abstraction has 107673 states and 158596 transitions. [2019-09-10 06:29:10,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 107673 states and 158596 transitions. [2019-09-10 06:29:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:29:11,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:11,021 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 06:29:11,021 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash -447273514, now seen corresponding path program 1 times [2019-09-10 06:29:11,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:11,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:11,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:11,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:11,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:11,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:11,304 INFO L87 Difference]: Start difference. First operand 107673 states and 158596 transitions. Second operand 3 states. [2019-09-10 06:29:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:11,830 INFO L93 Difference]: Finished difference Result 197695 states and 288400 transitions. [2019-09-10 06:29:11,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:11,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 06:29:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:12,054 INFO L225 Difference]: With dead ends: 197695 [2019-09-10 06:29:12,054 INFO L226 Difference]: Without dead ends: 197695 [2019-09-10 06:29:12,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197695 states. [2019-09-10 06:29:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197695 to 197601. [2019-09-10 06:29:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197601 states. [2019-09-10 06:29:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197601 states to 197601 states and 288289 transitions. [2019-09-10 06:29:16,686 INFO L78 Accepts]: Start accepts. Automaton has 197601 states and 288289 transitions. Word has length 324 [2019-09-10 06:29:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:16,687 INFO L475 AbstractCegarLoop]: Abstraction has 197601 states and 288289 transitions. [2019-09-10 06:29:16,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 197601 states and 288289 transitions. [2019-09-10 06:29:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:29:16,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:16,823 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 06:29:16,824 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 791445107, now seen corresponding path program 1 times [2019-09-10 06:29:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:16,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:17,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:17,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:17,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:17,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:17,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:17,101 INFO L87 Difference]: Start difference. First operand 197601 states and 288289 transitions. Second operand 4 states. [2019-09-10 06:29:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:18,038 INFO L93 Difference]: Finished difference Result 348450 states and 507334 transitions. [2019-09-10 06:29:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:18,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 06:29:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:18,416 INFO L225 Difference]: With dead ends: 348450 [2019-09-10 06:29:18,416 INFO L226 Difference]: Without dead ends: 348450 [2019-09-10 06:29:18,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348450 states. [2019-09-10 06:29:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348450 to 193666. [2019-09-10 06:29:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193666 states. [2019-09-10 06:29:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193666 states to 193666 states and 282532 transitions. [2019-09-10 06:29:25,389 INFO L78 Accepts]: Start accepts. Automaton has 193666 states and 282532 transitions. Word has length 324 [2019-09-10 06:29:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:25,389 INFO L475 AbstractCegarLoop]: Abstraction has 193666 states and 282532 transitions. [2019-09-10 06:29:25,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 193666 states and 282532 transitions. [2019-09-10 06:29:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 06:29:25,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:25,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:25,515 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash -489171085, now seen corresponding path program 1 times [2019-09-10 06:29:25,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:25,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:25,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:25,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:25,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:25,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:25,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:25,659 INFO L87 Difference]: Start difference. First operand 193666 states and 282532 transitions. Second operand 3 states. [2019-09-10 06:29:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:27,138 INFO L93 Difference]: Finished difference Result 345501 states and 503205 transitions. [2019-09-10 06:29:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:27,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 06:29:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:27,513 INFO L225 Difference]: With dead ends: 345501 [2019-09-10 06:29:27,514 INFO L226 Difference]: Without dead ends: 345501 [2019-09-10 06:29:27,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345501 states. [2019-09-10 06:29:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345501 to 194147. [2019-09-10 06:29:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194147 states. [2019-09-10 06:29:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194147 states to 194147 states and 283130 transitions. [2019-09-10 06:29:37,009 INFO L78 Accepts]: Start accepts. Automaton has 194147 states and 283130 transitions. Word has length 327 [2019-09-10 06:29:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:37,009 INFO L475 AbstractCegarLoop]: Abstraction has 194147 states and 283130 transitions. [2019-09-10 06:29:37,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 194147 states and 283130 transitions. [2019-09-10 06:29:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:29:37,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:37,133 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 06:29:37,134 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1966781366, now seen corresponding path program 1 times [2019-09-10 06:29:37,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:37,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:37,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:37,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:37,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:37,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:37,454 INFO L87 Difference]: Start difference. First operand 194147 states and 283130 transitions. Second operand 4 states. [2019-09-10 06:29:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:37,853 INFO L93 Difference]: Finished difference Result 188137 states and 274845 transitions. [2019-09-10 06:29:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:37,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 06:29:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:38,019 INFO L225 Difference]: With dead ends: 188137 [2019-09-10 06:29:38,020 INFO L226 Difference]: Without dead ends: 183969 [2019-09-10 06:29:38,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183969 states. [2019-09-10 06:29:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183969 to 183642. [2019-09-10 06:29:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183642 states. [2019-09-10 06:29:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183642 states to 183642 states and 267980 transitions. [2019-09-10 06:29:40,217 INFO L78 Accepts]: Start accepts. Automaton has 183642 states and 267980 transitions. Word has length 328 [2019-09-10 06:29:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:40,218 INFO L475 AbstractCegarLoop]: Abstraction has 183642 states and 267980 transitions. [2019-09-10 06:29:40,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 183642 states and 267980 transitions. [2019-09-10 06:29:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:29:40,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:40,342 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 06:29:40,343 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1151178778, now seen corresponding path program 1 times [2019-09-10 06:29:40,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:40,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:40,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:40,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:40,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:40,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:40,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:40,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:40,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:40,593 INFO L87 Difference]: Start difference. First operand 183642 states and 267980 transitions. Second operand 3 states. [2019-09-10 06:29:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:42,562 INFO L93 Difference]: Finished difference Result 324795 states and 471625 transitions. [2019-09-10 06:29:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:42,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 06:29:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:42,847 INFO L225 Difference]: With dead ends: 324795 [2019-09-10 06:29:42,847 INFO L226 Difference]: Without dead ends: 324795 [2019-09-10 06:29:42,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324795 states. [2019-09-10 06:29:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324795 to 324633. [2019-09-10 06:29:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324633 states. [2019-09-10 06:29:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324633 states to 324633 states and 471420 transitions. [2019-09-10 06:29:50,202 INFO L78 Accepts]: Start accepts. Automaton has 324633 states and 471420 transitions. Word has length 332 [2019-09-10 06:29:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:50,203 INFO L475 AbstractCegarLoop]: Abstraction has 324633 states and 471420 transitions. [2019-09-10 06:29:50,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 324633 states and 471420 transitions. [2019-09-10 06:29:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:29:50,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:50,390 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 06:29:50,391 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash -100909781, now seen corresponding path program 1 times [2019-09-10 06:29:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:50,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:50,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:50,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:50,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:50,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:50,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:50,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:50,718 INFO L87 Difference]: Start difference. First operand 324633 states and 471420 transitions. Second operand 4 states. [2019-09-10 06:29:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:51,577 INFO L93 Difference]: Finished difference Result 301747 states and 433308 transitions. [2019-09-10 06:29:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:51,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 06:29:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:51,853 INFO L225 Difference]: With dead ends: 301747 [2019-09-10 06:29:51,853 INFO L226 Difference]: Without dead ends: 301747 [2019-09-10 06:29:51,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301747 states. [2019-09-10 06:30:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301747 to 301745. [2019-09-10 06:30:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301745 states. [2019-09-10 06:30:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301745 states to 301745 states and 433307 transitions. [2019-09-10 06:30:01,496 INFO L78 Accepts]: Start accepts. Automaton has 301745 states and 433307 transitions. Word has length 332 [2019-09-10 06:30:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:01,500 INFO L475 AbstractCegarLoop]: Abstraction has 301745 states and 433307 transitions. [2019-09-10 06:30:01,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 301745 states and 433307 transitions. [2019-09-10 06:30:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:30:02,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:02,609 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1632277617, now seen corresponding path program 1 times [2019-09-10 06:30:02,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:02,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:02,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:02,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:02,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:02,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:02,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:02,858 INFO L87 Difference]: Start difference. First operand 301745 states and 433307 transitions. Second operand 3 states. [2019-09-10 06:30:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:04,301 INFO L93 Difference]: Finished difference Result 573203 states and 822822 transitions. [2019-09-10 06:30:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:04,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 06:30:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:04,962 INFO L225 Difference]: With dead ends: 573203 [2019-09-10 06:30:04,962 INFO L226 Difference]: Without dead ends: 573203 [2019-09-10 06:30:04,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573203 states. [2019-09-10 06:30:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573203 to 572631. [2019-09-10 06:30:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572631 states. [2019-09-10 06:30:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572631 states to 572631 states and 822251 transitions. [2019-09-10 06:30:18,207 INFO L78 Accepts]: Start accepts. Automaton has 572631 states and 822251 transitions. Word has length 332 [2019-09-10 06:30:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:18,208 INFO L475 AbstractCegarLoop]: Abstraction has 572631 states and 822251 transitions. [2019-09-10 06:30:18,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 572631 states and 822251 transitions. [2019-09-10 06:30:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:30:18,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:18,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 06:30:18,637 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1631938993, now seen corresponding path program 1 times [2019-09-10 06:30:18,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:18,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:18,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:20,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:20,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:20,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:20,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:20,347 INFO L87 Difference]: Start difference. First operand 572631 states and 822251 transitions. Second operand 4 states. [2019-09-10 06:30:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:31,098 INFO L93 Difference]: Finished difference Result 1061595 states and 1513223 transitions. [2019-09-10 06:30:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:31,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 06:30:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:32,605 INFO L225 Difference]: With dead ends: 1061595 [2019-09-10 06:30:32,605 INFO L226 Difference]: Without dead ends: 1061595 [2019-09-10 06:30:32,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:30:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061595 states. [2019-09-10 06:31:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061595 to 1061495. [2019-09-10 06:31:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061495 states. [2019-09-10 06:31:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061495 states to 1061495 states and 1513099 transitions. [2019-09-10 06:31:06,821 INFO L78 Accepts]: Start accepts. Automaton has 1061495 states and 1513099 transitions. Word has length 332 [2019-09-10 06:31:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:06,822 INFO L475 AbstractCegarLoop]: Abstraction has 1061495 states and 1513099 transitions. [2019-09-10 06:31:06,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1061495 states and 1513099 transitions. [2019-09-10 06:31:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 06:31:07,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:07,827 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] [2019-09-10 06:31:07,827 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1318450531, now seen corresponding path program 1 times [2019-09-10 06:31:07,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:07,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:07,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:31:08,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:08,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:31:08,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:08,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:31:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:31:08,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:31:08,055 INFO L87 Difference]: Start difference. First operand 1061495 states and 1513099 transitions. Second operand 3 states. [2019-09-10 06:31:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:26,020 INFO L93 Difference]: Finished difference Result 2076163 states and 2933022 transitions. [2019-09-10 06:31:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:31:26,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 06:31:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:38,987 INFO L225 Difference]: With dead ends: 2076163 [2019-09-10 06:31:38,988 INFO L226 Difference]: Without dead ends: 2076163 [2019-09-10 06:31:38,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:31:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076163 states.