java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:57:31,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:57:31,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:57:31,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:57:31,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:57:31,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:57:31,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:57:31,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:57:31,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:57:31,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:57:31,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:57:31,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:57:31,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:57:31,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:57:31,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:57:31,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:57:31,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:57:31,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:57:31,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:57:31,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:57:31,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:57:31,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:57:31,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:57:31,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:57:31,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:57:31,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:57:31,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:57:31,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:57:31,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:57:31,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:57:31,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:57:31,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:57:31,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:57:31,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:57:31,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:57:31,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:57:31,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:57:31,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:57:31,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:57:31,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:57:31,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:57:31,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:57:31,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:57:31,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:57:31,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:57:31,552 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:57:31,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:57:31,553 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:57:31,553 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:57:31,554 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:57:31,554 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:57:31,554 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:57:31,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:57:31,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:57:31,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:57:31,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:57:31,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:57:31,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:57:31,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:57:31,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:57:31,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:57:31,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:57:31,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:57:31,559 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:57:31,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:57:31,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:57:31,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:57:31,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:57:31,560 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:57:31,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:57:31,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:57:31,561 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:57:31,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:57:31,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:57:31,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:57:31,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:57:31,631 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:57:31,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:57:31,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51edcc8df/34f2f0c6292b45f790dcf946d9236b0d/FLAGfacdcf80f [2019-09-10 08:57:32,388 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:57:32,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:57:32,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51edcc8df/34f2f0c6292b45f790dcf946d9236b0d/FLAGfacdcf80f [2019-09-10 08:57:32,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51edcc8df/34f2f0c6292b45f790dcf946d9236b0d [2019-09-10 08:57:32,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:57:32,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:57:32,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:57:32,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:57:32,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:57:32,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:57:32" (1/1) ... [2019-09-10 08:57:32,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d8d0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:32, skipping insertion in model container [2019-09-10 08:57:32,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:57:32" (1/1) ... [2019-09-10 08:57:32,526 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:57:32,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:57:33,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:57:33,650 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:57:34,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:57:34,118 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:57:34,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34 WrapperNode [2019-09-10 08:57:34,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:57:34,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:57:34,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:57:34,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:57:34,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... [2019-09-10 08:57:34,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:57:34,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:57:34,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:57:34,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:57:34,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:57:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:57:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:57:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:57:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:57:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:57:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:57:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:57:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:57:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:57:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:57:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:57:34,387 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:57:34,387 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:57:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:57:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:57:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:57:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:57:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:57:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:57:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:57:37,193 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:57:37,194 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:57:37,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:57:37 BoogieIcfgContainer [2019-09-10 08:57:37,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:57:37,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:57:37,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:57:37,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:57:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:57:32" (1/3) ... [2019-09-10 08:57:37,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccea864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:57:37, skipping insertion in model container [2019-09-10 08:57:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:57:34" (2/3) ... [2019-09-10 08:57:37,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccea864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:57:37, skipping insertion in model container [2019-09-10 08:57:37,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:57:37" (3/3) ... [2019-09-10 08:57:37,203 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:57:37,216 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:57:37,228 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:57:37,247 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:57:37,279 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:57:37,279 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:57:37,279 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:57:37,279 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:57:37,279 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:57:37,280 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:57:37,280 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:57:37,280 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:57:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states. [2019-09-10 08:57:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:37,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:37,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:37,365 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2142230737, now seen corresponding path program 1 times [2019-09-10 08:57:37,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:37,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:37,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:38,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:38,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:38,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:38,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:38,499 INFO L87 Difference]: Start difference. First operand 789 states. Second operand 3 states. [2019-09-10 08:57:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:38,842 INFO L93 Difference]: Finished difference Result 1281 states and 2262 transitions. [2019-09-10 08:57:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:38,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:57:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:38,885 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 08:57:38,885 INFO L226 Difference]: Without dead ends: 1273 [2019-09-10 08:57:38,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-09-10 08:57:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1271. [2019-09-10 08:57:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-09-10 08:57:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1978 transitions. [2019-09-10 08:57:39,040 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1978 transitions. Word has length 326 [2019-09-10 08:57:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:39,045 INFO L475 AbstractCegarLoop]: Abstraction has 1271 states and 1978 transitions. [2019-09-10 08:57:39,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1978 transitions. [2019-09-10 08:57:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:39,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:39,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:39,061 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1353070899, now seen corresponding path program 1 times [2019-09-10 08:57:39,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:39,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:39,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:39,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 08:57:39,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:39,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:39,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:39,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:39,596 INFO L87 Difference]: Start difference. First operand 1271 states and 1978 transitions. Second operand 3 states. [2019-09-10 08:57:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:39,932 INFO L93 Difference]: Finished difference Result 2225 states and 3453 transitions. [2019-09-10 08:57:39,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:39,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:57:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:39,950 INFO L225 Difference]: With dead ends: 2225 [2019-09-10 08:57:39,950 INFO L226 Difference]: Without dead ends: 2225 [2019-09-10 08:57:39,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2019-09-10 08:57:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2223. [2019-09-10 08:57:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-10 08:57:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3452 transitions. [2019-09-10 08:57:40,046 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3452 transitions. Word has length 326 [2019-09-10 08:57:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:40,048 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3452 transitions. [2019-09-10 08:57:40,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3452 transitions. [2019-09-10 08:57:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:40,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:40,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:40,063 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash -222925148, now seen corresponding path program 1 times [2019-09-10 08:57:40,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:40,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:40,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:40,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:40,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:40,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:40,543 INFO L87 Difference]: Start difference. First operand 2223 states and 3452 transitions. Second operand 3 states. [2019-09-10 08:57:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:40,785 INFO L93 Difference]: Finished difference Result 4089 states and 6333 transitions. [2019-09-10 08:57:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:40,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:57:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:40,819 INFO L225 Difference]: With dead ends: 4089 [2019-09-10 08:57:40,819 INFO L226 Difference]: Without dead ends: 4089 [2019-09-10 08:57:40,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2019-09-10 08:57:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 4087. [2019-09-10 08:57:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4087 states. [2019-09-10 08:57:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4087 states to 4087 states and 6332 transitions. [2019-09-10 08:57:40,948 INFO L78 Accepts]: Start accepts. Automaton has 4087 states and 6332 transitions. Word has length 326 [2019-09-10 08:57:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:40,949 INFO L475 AbstractCegarLoop]: Abstraction has 4087 states and 6332 transitions. [2019-09-10 08:57:40,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4087 states and 6332 transitions. [2019-09-10 08:57:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:40,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:40,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:40,959 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash -806143976, now seen corresponding path program 1 times [2019-09-10 08:57:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:41,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:41,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:41,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:41,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:41,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:41,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:41,330 INFO L87 Difference]: Start difference. First operand 4087 states and 6332 transitions. Second operand 3 states. [2019-09-10 08:57:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:41,579 INFO L93 Difference]: Finished difference Result 7737 states and 11957 transitions. [2019-09-10 08:57:41,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:41,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:57:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:41,622 INFO L225 Difference]: With dead ends: 7737 [2019-09-10 08:57:41,622 INFO L226 Difference]: Without dead ends: 7737 [2019-09-10 08:57:41,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2019-09-10 08:57:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 7735. [2019-09-10 08:57:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7735 states. [2019-09-10 08:57:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7735 states to 7735 states and 11956 transitions. [2019-09-10 08:57:41,913 INFO L78 Accepts]: Start accepts. Automaton has 7735 states and 11956 transitions. Word has length 326 [2019-09-10 08:57:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:41,914 INFO L475 AbstractCegarLoop]: Abstraction has 7735 states and 11956 transitions. [2019-09-10 08:57:41,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7735 states and 11956 transitions. [2019-09-10 08:57:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:41,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:41,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:41,934 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1950973799, now seen corresponding path program 1 times [2019-09-10 08:57:41,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:41,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:43,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:43,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:43,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:43,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:43,084 INFO L87 Difference]: Start difference. First operand 7735 states and 11956 transitions. Second operand 4 states. [2019-09-10 08:57:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:43,320 INFO L93 Difference]: Finished difference Result 15238 states and 23431 transitions. [2019-09-10 08:57:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:43,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 08:57:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:43,388 INFO L225 Difference]: With dead ends: 15238 [2019-09-10 08:57:43,389 INFO L226 Difference]: Without dead ends: 15238 [2019-09-10 08:57:43,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15238 states. [2019-09-10 08:57:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15238 to 15236. [2019-09-10 08:57:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15236 states. [2019-09-10 08:57:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15236 states to 15236 states and 23430 transitions. [2019-09-10 08:57:43,767 INFO L78 Accepts]: Start accepts. Automaton has 15236 states and 23430 transitions. Word has length 326 [2019-09-10 08:57:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:43,767 INFO L475 AbstractCegarLoop]: Abstraction has 15236 states and 23430 transitions. [2019-09-10 08:57:43,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 15236 states and 23430 transitions. [2019-09-10 08:57:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:57:43,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:43,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:43,796 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1588647752, now seen corresponding path program 1 times [2019-09-10 08:57:43,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:43,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:44,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:44,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:44,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:44,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:44,231 INFO L87 Difference]: Start difference. First operand 15236 states and 23430 transitions. Second operand 3 states. [2019-09-10 08:57:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:44,612 INFO L93 Difference]: Finished difference Result 29862 states and 45638 transitions. [2019-09-10 08:57:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:44,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:57:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:44,683 INFO L225 Difference]: With dead ends: 29862 [2019-09-10 08:57:44,683 INFO L226 Difference]: Without dead ends: 29862 [2019-09-10 08:57:44,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29862 states. [2019-09-10 08:57:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29862 to 29860. [2019-09-10 08:57:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29860 states. [2019-09-10 08:57:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29860 states to 29860 states and 45637 transitions. [2019-09-10 08:57:45,435 INFO L78 Accepts]: Start accepts. Automaton has 29860 states and 45637 transitions. Word has length 328 [2019-09-10 08:57:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:45,436 INFO L475 AbstractCegarLoop]: Abstraction has 29860 states and 45637 transitions. [2019-09-10 08:57:45,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 29860 states and 45637 transitions. [2019-09-10 08:57:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:57:45,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:45,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:45,500 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash -144550515, now seen corresponding path program 1 times [2019-09-10 08:57:45,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:45,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:45,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:45,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:45,670 INFO L87 Difference]: Start difference. First operand 29860 states and 45637 transitions. Second operand 3 states. [2019-09-10 08:57:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:46,406 INFO L93 Difference]: Finished difference Result 59687 states and 91214 transitions. [2019-09-10 08:57:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:46,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:57:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:46,564 INFO L225 Difference]: With dead ends: 59687 [2019-09-10 08:57:46,564 INFO L226 Difference]: Without dead ends: 59687 [2019-09-10 08:57:46,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59687 states. [2019-09-10 08:57:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59687 to 29879. [2019-09-10 08:57:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29879 states. [2019-09-10 08:57:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29879 states to 29879 states and 45665 transitions. [2019-09-10 08:57:47,261 INFO L78 Accepts]: Start accepts. Automaton has 29879 states and 45665 transitions. Word has length 328 [2019-09-10 08:57:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:47,262 INFO L475 AbstractCegarLoop]: Abstraction has 29879 states and 45665 transitions. [2019-09-10 08:57:47,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29879 states and 45665 transitions. [2019-09-10 08:57:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 08:57:47,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:47,311 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] [2019-09-10 08:57:47,311 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1226611437, now seen corresponding path program 1 times [2019-09-10 08:57:47,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:47,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:47,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:47,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:47,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:47,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:47,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:47,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:47,469 INFO L87 Difference]: Start difference. First operand 29879 states and 45665 transitions. Second operand 3 states. [2019-09-10 08:57:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:47,699 INFO L93 Difference]: Finished difference Result 59705 states and 91235 transitions. [2019-09-10 08:57:47,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:47,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 08:57:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:47,829 INFO L225 Difference]: With dead ends: 59705 [2019-09-10 08:57:47,829 INFO L226 Difference]: Without dead ends: 59705 [2019-09-10 08:57:47,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59705 states. [2019-09-10 08:57:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59705 to 29897. [2019-09-10 08:57:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29897 states. [2019-09-10 08:57:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29897 states to 29897 states and 45686 transitions. [2019-09-10 08:57:49,238 INFO L78 Accepts]: Start accepts. Automaton has 29897 states and 45686 transitions. Word has length 329 [2019-09-10 08:57:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:49,239 INFO L475 AbstractCegarLoop]: Abstraction has 29897 states and 45686 transitions. [2019-09-10 08:57:49,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 29897 states and 45686 transitions. [2019-09-10 08:57:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:57:49,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:49,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:49,291 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1870669955, now seen corresponding path program 1 times [2019-09-10 08:57:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:49,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:49,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:49,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:49,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:49,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:49,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:49,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:49,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:49,585 INFO L87 Difference]: Start difference. First operand 29897 states and 45686 transitions. Second operand 3 states. [2019-09-10 08:57:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:49,840 INFO L93 Difference]: Finished difference Result 55182 states and 83719 transitions. [2019-09-10 08:57:49,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:49,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:57:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:49,972 INFO L225 Difference]: With dead ends: 55182 [2019-09-10 08:57:49,973 INFO L226 Difference]: Without dead ends: 55182 [2019-09-10 08:57:49,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55182 states. [2019-09-10 08:57:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55182 to 55180. [2019-09-10 08:57:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55180 states. [2019-09-10 08:57:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55180 states to 55180 states and 83718 transitions. [2019-09-10 08:57:51,070 INFO L78 Accepts]: Start accepts. Automaton has 55180 states and 83718 transitions. Word has length 330 [2019-09-10 08:57:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:51,070 INFO L475 AbstractCegarLoop]: Abstraction has 55180 states and 83718 transitions. [2019-09-10 08:57:51,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 55180 states and 83718 transitions. [2019-09-10 08:57:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:57:51,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:51,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:51,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2005560288, now seen corresponding path program 1 times [2019-09-10 08:57:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:51,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:51,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:51,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:51,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57: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 08:57:51,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:51,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:51,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:51,548 INFO L87 Difference]: Start difference. First operand 55180 states and 83718 transitions. Second operand 4 states. [2019-09-10 08:57:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:51,892 INFO L93 Difference]: Finished difference Result 106456 states and 161384 transitions. [2019-09-10 08:57:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:51,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-10 08:57:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:52,237 INFO L225 Difference]: With dead ends: 106456 [2019-09-10 08:57:52,238 INFO L226 Difference]: Without dead ends: 106456 [2019-09-10 08:57:52,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106456 states. [2019-09-10 08:57:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106456 to 55415. [2019-09-10 08:57:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55415 states. [2019-09-10 08:57:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55415 states to 55415 states and 84106 transitions. [2019-09-10 08:57:54,885 INFO L78 Accepts]: Start accepts. Automaton has 55415 states and 84106 transitions. Word has length 330 [2019-09-10 08:57:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:54,886 INFO L475 AbstractCegarLoop]: Abstraction has 55415 states and 84106 transitions. [2019-09-10 08:57:54,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55415 states and 84106 transitions. [2019-09-10 08:57:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 08:57:54,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:54,940 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] [2019-09-10 08:57:54,941 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash -111677560, now seen corresponding path program 1 times [2019-09-10 08:57:54,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:54,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:54,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:55,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:55,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:55,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:55,142 INFO L87 Difference]: Start difference. First operand 55415 states and 84106 transitions. Second operand 3 states. [2019-09-10 08:57:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:55,512 INFO L93 Difference]: Finished difference Result 81081 states and 124839 transitions. [2019-09-10 08:57:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:55,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 08:57:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:55,650 INFO L225 Difference]: With dead ends: 81081 [2019-09-10 08:57:55,651 INFO L226 Difference]: Without dead ends: 81081 [2019-09-10 08:57:55,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81081 states. [2019-09-10 08:57:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81081 to 70359. [2019-09-10 08:57:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70359 states. [2019-09-10 08:57:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70359 states to 70359 states and 108702 transitions. [2019-09-10 08:57:57,223 INFO L78 Accepts]: Start accepts. Automaton has 70359 states and 108702 transitions. Word has length 331 [2019-09-10 08:57:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:57,224 INFO L475 AbstractCegarLoop]: Abstraction has 70359 states and 108702 transitions. [2019-09-10 08:57:57,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 70359 states and 108702 transitions. [2019-09-10 08:57:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:57:57,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:57,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:57,272 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 813192752, now seen corresponding path program 1 times [2019-09-10 08:57:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:57,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:57,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:57,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:57,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:57,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:57,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:57,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:57,437 INFO L87 Difference]: Start difference. First operand 70359 states and 108702 transitions. Second operand 3 states. [2019-09-10 08:57:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:57,852 INFO L93 Difference]: Finished difference Result 139951 states and 216048 transitions. [2019-09-10 08:57:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:57,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:57:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:58,052 INFO L225 Difference]: With dead ends: 139951 [2019-09-10 08:57:58,052 INFO L226 Difference]: Without dead ends: 139951 [2019-09-10 08:57:58,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139951 states. [2019-09-10 08:58:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139951 to 70463. [2019-09-10 08:58:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70463 states. [2019-09-10 08:58:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70463 states to 70463 states and 108845 transitions. [2019-09-10 08:58:01,190 INFO L78 Accepts]: Start accepts. Automaton has 70463 states and 108845 transitions. Word has length 332 [2019-09-10 08:58:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:01,190 INFO L475 AbstractCegarLoop]: Abstraction has 70463 states and 108845 transitions. [2019-09-10 08:58:01,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 70463 states and 108845 transitions. [2019-09-10 08:58:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:58:01,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:01,224 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] [2019-09-10 08:58:01,224 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2066939154, now seen corresponding path program 1 times [2019-09-10 08:58:01,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:01,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:01,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:01,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:01,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:01,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:01,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:01,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:01,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:01,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:01,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:01,375 INFO L87 Difference]: Start difference. First operand 70463 states and 108845 transitions. Second operand 3 states. [2019-09-10 08:58:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:02,247 INFO L93 Difference]: Finished difference Result 140076 states and 216194 transitions. [2019-09-10 08:58:02,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:58:02,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-10 08:58:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:02,419 INFO L225 Difference]: With dead ends: 140076 [2019-09-10 08:58:02,419 INFO L226 Difference]: Without dead ends: 140076 [2019-09-10 08:58:02,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140076 states. [2019-09-10 08:58:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140076 to 70588. [2019-09-10 08:58:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70588 states. [2019-09-10 08:58:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70588 states to 70588 states and 108991 transitions. [2019-09-10 08:58:03,457 INFO L78 Accepts]: Start accepts. Automaton has 70588 states and 108991 transitions. Word has length 333 [2019-09-10 08:58:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:03,458 INFO L475 AbstractCegarLoop]: Abstraction has 70588 states and 108991 transitions. [2019-09-10 08:58:03,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 70588 states and 108991 transitions. [2019-09-10 08:58:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:58:03,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:03,490 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 08:58:03,490 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 243839709, now seen corresponding path program 1 times [2019-09-10 08:58:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:03,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:03,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:03,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:03,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:03,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:03,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:03,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:03,669 INFO L87 Difference]: Start difference. First operand 70588 states and 108991 transitions. Second operand 3 states. [2019-09-10 08:58:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:05,540 INFO L93 Difference]: Finished difference Result 114798 states and 178388 transitions. [2019-09-10 08:58:05,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:58:05,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 08:58:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:05,645 INFO L225 Difference]: With dead ends: 114798 [2019-09-10 08:58:05,645 INFO L226 Difference]: Without dead ends: 114798 [2019-09-10 08:58:05,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114798 states. [2019-09-10 08:58:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114798 to 97932. [2019-09-10 08:58:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97932 states. [2019-09-10 08:58:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97932 states to 97932 states and 153711 transitions. [2019-09-10 08:58:06,570 INFO L78 Accepts]: Start accepts. Automaton has 97932 states and 153711 transitions. Word has length 334 [2019-09-10 08:58:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:06,571 INFO L475 AbstractCegarLoop]: Abstraction has 97932 states and 153711 transitions. [2019-09-10 08:58:06,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 97932 states and 153711 transitions. [2019-09-10 08:58:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:58:06,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:06,620 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 08:58:06,620 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 729583107, now seen corresponding path program 1 times [2019-09-10 08:58:06,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:06,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:06,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:07,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:07,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:58:07,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:07,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:58:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:58:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:58:07,087 INFO L87 Difference]: Start difference. First operand 97932 states and 153711 transitions. Second operand 4 states. [2019-09-10 08:58:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:07,366 INFO L93 Difference]: Finished difference Result 92434 states and 144990 transitions. [2019-09-10 08:58:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:58:07,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-10 08:58:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:08,108 INFO L225 Difference]: With dead ends: 92434 [2019-09-10 08:58:08,109 INFO L226 Difference]: Without dead ends: 91637 [2019-09-10 08:58:08,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:58:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91637 states. [2019-09-10 08:58:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91637 to 91617. [2019-09-10 08:58:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91617 states. [2019-09-10 08:58:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91617 states to 91617 states and 143723 transitions. [2019-09-10 08:58:09,097 INFO L78 Accepts]: Start accepts. Automaton has 91617 states and 143723 transitions. Word has length 334 [2019-09-10 08:58:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:09,097 INFO L475 AbstractCegarLoop]: Abstraction has 91617 states and 143723 transitions. [2019-09-10 08:58:09,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 91617 states and 143723 transitions. [2019-09-10 08:58:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:58:09,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:09,127 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 08:58:09,128 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1706357877, now seen corresponding path program 1 times [2019-09-10 08:58:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:09,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:09,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:09,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:09,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:58:09,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:09,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:58:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:58:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:58:09,458 INFO L87 Difference]: Start difference. First operand 91617 states and 143723 transitions. Second operand 5 states. [2019-09-10 08:58:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:10,254 INFO L93 Difference]: Finished difference Result 91617 states and 142841 transitions. [2019-09-10 08:58:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:58:10,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 334 [2019-09-10 08:58:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:10,495 INFO L225 Difference]: With dead ends: 91617 [2019-09-10 08:58:10,495 INFO L226 Difference]: Without dead ends: 91617 [2019-09-10 08:58:10,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:58:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91617 states. [2019-09-10 08:58:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91617 to 91617. [2019-09-10 08:58:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91617 states. [2019-09-10 08:58:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91617 states to 91617 states and 142841 transitions. [2019-09-10 08:58:12,029 INFO L78 Accepts]: Start accepts. Automaton has 91617 states and 142841 transitions. Word has length 334 [2019-09-10 08:58:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:12,030 INFO L475 AbstractCegarLoop]: Abstraction has 91617 states and 142841 transitions. [2019-09-10 08:58:12,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:58:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91617 states and 142841 transitions. [2019-09-10 08:58:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:58:12,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:12,061 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 08:58:12,062 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1438691824, now seen corresponding path program 1 times [2019-09-10 08:58:12,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:12,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:12,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:12,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:12,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:58:12,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:12,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:58:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:58:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:58:12,524 INFO L87 Difference]: Start difference. First operand 91617 states and 142841 transitions. Second operand 9 states. [2019-09-10 08:58:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:19,308 INFO L93 Difference]: Finished difference Result 599480 states and 943371 transitions. [2019-09-10 08:58:19,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:58:19,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 334 [2019-09-10 08:58:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:20,275 INFO L225 Difference]: With dead ends: 599480 [2019-09-10 08:58:20,275 INFO L226 Difference]: Without dead ends: 599480 [2019-09-10 08:58:20,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:58:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599480 states. [2019-09-10 08:58:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599480 to 261706. [2019-09-10 08:58:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261706 states. [2019-09-10 08:58:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261706 states to 261706 states and 407370 transitions. [2019-09-10 08:58:31,082 INFO L78 Accepts]: Start accepts. Automaton has 261706 states and 407370 transitions. Word has length 334 [2019-09-10 08:58:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:31,082 INFO L475 AbstractCegarLoop]: Abstraction has 261706 states and 407370 transitions. [2019-09-10 08:58:31,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:58:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 261706 states and 407370 transitions. [2019-09-10 08:58:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:58:31,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:31,170 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 08:58:31,171 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash 629698269, now seen corresponding path program 1 times [2019-09-10 08:58:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:31,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:31,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:31,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:58:31,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:31,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:58:31,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:58:31,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:58:31,782 INFO L87 Difference]: Start difference. First operand 261706 states and 407370 transitions. Second operand 4 states. [2019-09-10 08:58:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:39,298 INFO L93 Difference]: Finished difference Result 513635 states and 797817 transitions. [2019-09-10 08:58:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:58:39,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-10 08:58:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:40,006 INFO L225 Difference]: With dead ends: 513635 [2019-09-10 08:58:40,006 INFO L226 Difference]: Without dead ends: 513635 [2019-09-10 08:58:40,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:58:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513635 states. [2019-09-10 08:58:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513635 to 513633. [2019-09-10 08:58:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513633 states. [2019-09-10 08:58:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513633 states to 513633 states and 797816 transitions. [2019-09-10 08:58:46,113 INFO L78 Accepts]: Start accepts. Automaton has 513633 states and 797816 transitions. Word has length 334 [2019-09-10 08:58:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:46,114 INFO L475 AbstractCegarLoop]: Abstraction has 513633 states and 797816 transitions. [2019-09-10 08:58:46,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 513633 states and 797816 transitions. [2019-09-10 08:58:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:58:46,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:46,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:58:46,274 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1208008503, now seen corresponding path program 1 times [2019-09-10 08:58:46,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:46,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:46,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:46,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:46,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:46,526 INFO L87 Difference]: Start difference. First operand 513633 states and 797816 transitions. Second operand 3 states. [2019-09-10 08:58:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:56,146 INFO L93 Difference]: Finished difference Result 1003875 states and 1550611 transitions. [2019-09-10 08:58:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:58:56,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 08:58:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:57,757 INFO L225 Difference]: With dead ends: 1003875 [2019-09-10 08:58:57,757 INFO L226 Difference]: Without dead ends: 1003875 [2019-09-10 08:58:57,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003875 states. [2019-09-10 08:59:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003875 to 1003873. [2019-09-10 08:59:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003873 states. [2019-09-10 08:59:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003873 states to 1003873 states and 1550610 transitions. [2019-09-10 08:59:36,813 INFO L78 Accepts]: Start accepts. Automaton has 1003873 states and 1550610 transitions. Word has length 336 [2019-09-10 08:59:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:36,813 INFO L475 AbstractCegarLoop]: Abstraction has 1003873 states and 1550610 transitions. [2019-09-10 08:59:36,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:59:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1003873 states and 1550610 transitions. [2019-09-10 08:59:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 08:59:37,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:37,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:59:37,235 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash -832025506, now seen corresponding path program 1 times [2019-09-10 08:59:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:37,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:59:37,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:37,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:37,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:37,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:37,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:37,433 INFO L87 Difference]: Start difference. First operand 1003873 states and 1550610 transitions. Second operand 3 states. [2019-09-10 08:59:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:52,902 INFO L93 Difference]: Finished difference Result 1710179 states and 2649891 transitions. [2019-09-10 08:59:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:52,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-09-10 08:59:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:06,719 INFO L225 Difference]: With dead ends: 1710179 [2019-09-10 09:00:06,719 INFO L226 Difference]: Without dead ends: 1710179 [2019-09-10 09:00:06,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710179 states. [2019-09-10 09:00:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710179 to 1542625. [2019-09-10 09:00:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542625 states.